./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:25:45,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:25:45,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:25:45,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:25:45,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:25:45,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:25:45,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:25:45,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:25:45,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:25:45,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:25:45,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:25:45,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:25:45,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:25:45,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:25:45,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:25:45,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:25:45,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:25:45,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:25:45,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:25:45,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:25:45,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:25:45,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:25:45,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:25:45,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:25:45,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:25:45,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:25:45,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:25:45,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:25:45,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:25:45,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:25:45,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:25:45,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:25:46,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:25:46,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:25:46,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:25:46,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:25:46,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:25:46,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:25:46,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:25:46,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:25:46,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:25:46,008 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-18 20:25:46,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:25:46,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:25:46,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:25:46,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:25:46,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:25:46,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:25:46,051 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:25:46,051 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-18 20:25:46,051 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-18 20:25:46,051 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-18 20:25:46,051 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-18 20:25:46,052 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-18 20:25:46,052 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-18 20:25:46,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:25:46,052 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:25:46,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:25:46,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:25:46,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-18 20:25:46,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-18 20:25:46,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-18 20:25:46,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:25:46,054 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-18 20:25:46,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:25:46,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-18 20:25:46,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:25:46,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:25:46,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:25:46,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:25:46,056 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-18 20:25:46,056 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_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/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_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro 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-18 20:25:46,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:25:46,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:25:46,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:25:46,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:25:46,345 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:25:46,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-18 20:25:46,408 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/data/4d500144e/f994f29d5bea4f2484847b930ae3ef4d/FLAG1e2992bab [2022-11-18 20:25:46,834 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:25:46,834 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-18 20:25:46,841 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/data/4d500144e/f994f29d5bea4f2484847b930ae3ef4d/FLAG1e2992bab [2022-11-18 20:25:46,857 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/data/4d500144e/f994f29d5bea4f2484847b930ae3ef4d [2022-11-18 20:25:46,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:25:46,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:25:46,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:25:46,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:25:46,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:25:46,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:25:46" (1/1) ... [2022-11-18 20:25:46,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16210d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:46, skipping insertion in model container [2022-11-18 20:25:46,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:25:46" (1/1) ... [2022-11-18 20:25:46,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:25:46,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:25:47,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:25:47,097 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:25:47,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:25:47,122 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:25:47,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47 WrapperNode [2022-11-18 20:25:47,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:25:47,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:25:47,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:25:47,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:25:47,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,156 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-11-18 20:25:47,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:25:47,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:25:47,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:25:47,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:25:47,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,176 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:25:47,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:25:47,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:25:47,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:25:47,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (1/1) ... [2022-11-18 20:25:47,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:47,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:47,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:47,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-18 20:25:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2022-11-18 20:25:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2022-11-18 20:25:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:25:47,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:25:47,328 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:25:47,330 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:25:47,578 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:25:47,585 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:25:47,599 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:25:47,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:25:47 BoogieIcfgContainer [2022-11-18 20:25:47,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:25:47,602 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-18 20:25:47,602 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-18 20:25:47,607 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-18 20:25:47,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-18 20:25:47,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:25:46" (1/3) ... [2022-11-18 20:25:47,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db2e815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:25:47, skipping insertion in model container [2022-11-18 20:25:47,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-18 20:25:47,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:25:47" (2/3) ... [2022-11-18 20:25:47,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db2e815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:25:47, skipping insertion in model container [2022-11-18 20:25:47,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-18 20:25:47,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:25:47" (3/3) ... [2022-11-18 20:25:47,611 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2022-11-18 20:25:47,688 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-18 20:25:47,688 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-18 20:25:47,688 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-18 20:25:47,688 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-18 20:25:47,688 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-18 20:25:47,688 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-18 20:25:47,689 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-18 20:25:47,689 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-18 20:25:47,693 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-18 20:25:47,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-18 20:25:47,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:47,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:47,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-18 20:25:47,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-18 20:25:47,722 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-18 20:25:47,723 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-18 20:25:47,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-18 20:25:47,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:47,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:47,726 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-18 20:25:47,726 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-18 20:25:47,734 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-18 20:25:47,734 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-18 20:25:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2022-11-18 20:25:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:47,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306462424] [2022-11-18 20:25:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:47,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:47,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2022-11-18 20:25:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:47,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073963906] [2022-11-18 20:25:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:47,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:47,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:47,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2022-11-18 20:25:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:47,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236107298] [2022-11-18 20:25:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:47,979 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-18 20:25:47,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:25:47,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236107298] [2022-11-18 20:25:47,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236107298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:25:47,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:25:47,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:25:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886059735] [2022-11-18 20:25:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:25:48,053 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:25:48,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:25:48,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:25:48,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:25:48,054 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:25:48,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:25:48,055 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:25:48,055 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-18 20:25:48,055 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:25:48,055 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:25:48,073 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-18 20:25:48,085 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-18 20:25:48,166 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:25:48,167 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:25:48,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:48,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:48,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:25:48,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:48,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-18 20:25:48,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:25:48,200 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-18 20:25:48,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:48,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:48,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:48,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-18 20:25:48,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:25:48,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:48,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:48,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:48,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:48,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:25:48,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:48,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-18 20:25:48,451 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:25:48,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-11-18 20:25:48,455 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:25:48,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:25:48,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:25:48,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:25:48,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:25:48,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:25:48,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:25:48,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-18 20:25:48,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:25:48,457 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:25:48,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-18 20:25:48,465 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-18 20:25:48,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:25:48,540 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:25:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:48,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:48,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:48,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-18 20:25:48,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:48,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:48,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:48,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:48,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:48,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:48,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:48,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:48,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:48,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:48,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:48,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:48,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:48,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:48,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:48,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:48,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:48,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:48,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:48,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-18 20:25:48,658 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:25:48,669 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-18 20:25:48,669 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-18 20:25:48,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:48,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:48,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:48,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-18 20:25:48,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:25:48,709 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:25:48,709 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:25:48,710 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-18 20:25:48,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-11-18 20:25:48,719 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:25:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:48,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:25:48,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:48,805 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:25:48,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:48,872 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-18 20:25:48,905 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-18 20:25:48,906 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-18 20:25:48,995 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-18 20:25:48,997 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-18 20:25:49,002 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-18 20:25:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-11-18 20:25:49,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2022-11-18 20:25:49,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:25:49,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-18 20:25:49,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:25:49,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2022-11-18 20:25:49,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:25:49,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2022-11-18 20:25:49,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-18 20:25:49,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2022-11-18 20:25:49,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-11-18 20:25:49,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-11-18 20:25:49,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2022-11-18 20:25:49,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:25:49,024 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-18 20:25:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2022-11-18 20:25:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-11-18 20:25:49,055 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-18 20:25:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-11-18 20:25:49,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-11-18 20:25:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:25:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:25:49,061 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-18 20:25:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:25:49,122 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-18 20:25:49,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-11-18 20:25:49,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-18 20:25:49,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2022-11-18 20:25:49,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-11-18 20:25:49,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-11-18 20:25:49,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-11-18 20:25:49,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:25:49,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-18 20:25:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-11-18 20:25:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-18 20:25:49,130 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-18 20:25:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-18 20:25:49,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-18 20:25:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:25:49,132 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-18 20:25:49,133 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-18 20:25:49,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-11-18 20:25:49,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-18 20:25:49,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:49,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:49,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-18 20:25:49,139 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-18 20:25:49,139 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-18 20:25:49,140 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-18 20:25:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2022-11-18 20:25:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:49,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226842716] [2022-11-18 20:25:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:49,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:49,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2022-11-18 20:25:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530653952] [2022-11-18 20:25:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:49,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:49,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416972077] [2022-11-18 20:25:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:49,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:49,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:25:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:49,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:25:49,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:49,299 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-18 20:25:49,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:25:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:25:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530653952] [2022-11-18 20:25:49,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:25:49,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416972077] [2022-11-18 20:25:49,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416972077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:25:49,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:25:49,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:25:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176654815] [2022-11-18 20:25:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:25:49,301 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:25:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:25:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:25:49,302 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-18 20:25:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:25:49,379 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-18 20:25:49,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-18 20:25:49,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2022-11-18 20:25:49,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-18 20:25:49,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-18 20:25:49,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-11-18 20:25:49,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-18 20:25:49,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:25:49,384 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-18 20:25:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-18 20:25:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-18 20:25:49,387 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-18 20:25:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-11-18 20:25:49,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-18 20:25:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:25:49,401 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-18 20:25:49,401 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-18 20:25:49,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2022-11-18 20:25:49,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-18 20:25:49,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:49,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:49,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-18 20:25:49,403 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-18 20:25:49,403 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-18 20:25:49,403 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-18 20:25:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2022-11-18 20:25:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102258865] [2022-11-18 20:25:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:49,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:49,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2022-11-18 20:25:49,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:49,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725729536] [2022-11-18 20:25:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:49,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:49,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:49,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011784037] [2022-11-18 20:25:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:49,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:49,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:49,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:25:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:49,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:49,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2022-11-18 20:25:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:49,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026168695] [2022-11-18 20:25:49,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:49,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:25:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026168695] [2022-11-18 20:25:49,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-18 20:25:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985151360] [2022-11-18 20:25:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:49,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:49,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:49,615 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:49,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:25:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:49,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:25:49,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:49,709 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-18 20:25:49,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:25:49,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985151360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:25:49,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:25:49,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:25:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862481726] [2022-11-18 20:25:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:25:50,149 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:25:50,150 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:25:50,150 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:25:50,150 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:25:50,150 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:25:50,150 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:50,150 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:25:50,150 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:25:50,150 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-18 20:25:50,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:25:50,151 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:25:50,153 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-18 20:25:50,156 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-18 20:25:50,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-18 20:25:50,198 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-18 20:25:50,201 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-18 20:25:50,203 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-18 20:25:50,211 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-18 20:25:50,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:25:50,575 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:25:50,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:50,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:50,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:50,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-18 20:25:50,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:25:50,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:50,605 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:25:50,605 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-18 20:25:50,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:50,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:50,621 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:50,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:25:50,627 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:50,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-18 20:25:50,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:50,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:50,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:50,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:50,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:25:50,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:50,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-18 20:25:50,734 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:25:50,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:50,743 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:25:50,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:25:50,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:25:50,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:25:50,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:25:50,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:50,744 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:25:50,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:25:50,744 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-18 20:25:50,744 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:25:50,744 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:25:50,746 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-18 20:25:50,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-18 20:25:50,751 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-18 20:25:50,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-18 20:25:50,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-18 20:25:50,758 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-18 20:25:50,761 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-18 20:25:51,136 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:25:51,136 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:25:51,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,138 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:51,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:51,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-18 20:25:51,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,172 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:51,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:51,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-18 20:25:51,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,225 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:51,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:51,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-18 20:25:51,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,277 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:25:51,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-18 20:25:51,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:51,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:51,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,316 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-18 20:25:51,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:51,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:51,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,352 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-18 20:25:51,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:51,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:51,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,398 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-18 20:25:51,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:51,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:51,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,456 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-18 20:25:51,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,457 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,479 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:51,480 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:51,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-18 20:25:51,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-11-18 20:25:51,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,508 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-18 20:25:51,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,529 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:51,531 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:51,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,551 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,568 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:51,569 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:51,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-18 20:25:51,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,597 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,613 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:51,614 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:51,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-18 20:25:51,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,637 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,654 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:51,655 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:51,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-18 20:25:51,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,681 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,697 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:51,698 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:51,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-18 20:25:51,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,725 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-18 20:25:51,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,742 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:51,747 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:51,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,779 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-18 20:25:51,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,781 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,799 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:51,800 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:51,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-18 20:25:51,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,825 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-18 20:25:51,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,842 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:51,844 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:51,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,873 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,890 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:51,892 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:51,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-18 20:25:51,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,921 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,938 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:51,939 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:51,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-18 20:25:51,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:51,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:51,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:51,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:51,966 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:51,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:51,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:51,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:51,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:51,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:51,985 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:51,986 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:51,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:51,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-18 20:25:51,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,009 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-18 20:25:52,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,026 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,027 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,048 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-18 20:25:52,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,067 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,078 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,108 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-18 20:25:52,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,109 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,126 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:52,127 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:52,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-18 20:25:52,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,155 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,172 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:52,173 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:52,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-18 20:25:52,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,188 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,205 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:52,207 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:52,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-18 20:25:52,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,240 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,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-18 20:25:52,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,257 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:52,259 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:52,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-18 20:25:52,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,284 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,302 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:52,304 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:52,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-18 20:25:52,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,320 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-18 20:25:52,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,343 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:52,343 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:52,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,363 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:25:52,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-18 20:25:52,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:52,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,382 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:52,390 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:52,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,419 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-18 20:25:52,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,421 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,438 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,438 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:52,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,439 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:52,440 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:52,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-18 20:25:52,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,464 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-18 20:25:52,483 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,483 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:52,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,484 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:52,484 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:52,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,517 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,533 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,533 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:52,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,533 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:52,534 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:52,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-18 20:25:52,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,560 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,576 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,576 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:52,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,576 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:52,577 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:52,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-18 20:25:52,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,603 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,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-18 20:25:52,624 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,625 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:52,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,625 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:52,626 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:52,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-18 20:25:52,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,648 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-11-18 20:25:52,665 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,665 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:52,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,666 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:52,668 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:52,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,690 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25: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-18 20:25:52,709 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,709 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:52,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,710 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-18 20:25:52,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-11-18 20:25:52,717 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-18 20:25:52,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,743 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-18 20:25:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,744 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,761 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,761 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-18 20:25:52,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,761 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,763 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-11-18 20:25:52,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,782 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-11-18 20:25:52,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,797 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,797 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-18 20:25:52,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,798 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,799 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,817 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,838 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,838 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-18 20:25:52,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,839 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,841 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-18 20:25:52,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,864 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,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-18 20:25:52,880 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,880 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-18 20:25:52,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,881 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,882 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-18 20:25:52,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,898 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-18 20:25:52,916 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,916 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-18 20:25:52,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,917 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,918 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,942 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:52,958 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:52,958 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-18 20:25:52,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:52,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:52,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:52,959 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:52,961 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:52,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:52,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-18 20:25:52,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:52,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:52,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:52,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:52,984 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:52,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-18 20:25:52,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,002 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,003 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-18 20:25:53,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,003 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,023 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,053 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-18 20:25:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,054 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,072 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,072 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,073 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:53,078 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:53,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-18 20:25:53,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,117 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,140 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,140 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,141 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:53,144 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:53,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-18 20:25:53,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,168 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,189 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,189 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,189 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:53,191 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:53,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-18 20:25:53,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,220 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,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-18 20:25:53,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-18 20:25:53,237 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,237 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,237 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:53,239 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:53,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,264 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:25:53,280 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,281 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,281 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:53,283 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:53,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-18 20:25:53,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,306 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-18 20:25:53,324 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,324 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,324 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:53,326 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:53,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,348 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-18 20:25:53,369 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,369 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,370 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-18 20:25:53,383 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-18 20:25:53,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,430 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-18 20:25:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,431 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-18 20:25:53,449 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,449 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:53,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,450 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,451 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,472 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:25:53,489 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,489 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:53,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,489 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-11-18 20:25:53,490 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,505 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:25:53,523 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-18 20:25:53,523 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:53,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,523 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,524 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,539 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-18 20:25:53,556 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,556 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:53,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,556 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,557 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,584 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:25:53,607 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,607 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:53,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,607 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,608 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-18 20:25:53,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,623 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-18 20:25:53,640 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,640 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:53,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,641 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,642 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,657 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,674 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,674 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-18 20:25:53,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,674 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-18 20:25:53,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-18 20:25:53,681 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-18 20:25:53,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,706 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-18 20:25:53,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,708 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-18 20:25:53,724 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,724 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,725 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-18 20:25:53,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-18 20:25:53,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,748 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,764 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,765 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,765 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-18 20:25:53,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-18 20:25:53,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-18 20:25:53,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,792 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,810 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,810 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,810 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-18 20:25:53,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-18 20:25:53,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-18 20:25:53,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,829 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,845 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,846 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,846 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-18 20:25:53,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-18 20:25:53,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-11-18 20:25:53,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,864 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,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-18 20:25:53,880 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,880 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,881 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-18 20:25:53,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-18 20:25:53,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-11-18 20:25:53,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,904 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:25:53,920 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,920 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,921 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-18 20:25:53,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-18 20:25:53,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:53,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-11-18 20:25:53,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:53,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:53,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:53,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:53,944 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:53,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:53,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-18 20:25:53,962 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-18 20:25:53,962 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-18 20:25:53,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:53,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:53,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:53,962 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-18 20:25:53,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-18 20:25:53,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:54,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:54,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:25:54,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:25:54,046 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-18 20:25:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:25:54,106 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2022-11-18 20:25:54,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2022-11-18 20:25:54,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-11-18 20:25:54,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2022-11-18 20:25:54,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-18 20:25:54,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-18 20:25:54,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2022-11-18 20:25:54,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:25:54,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2022-11-18 20:25:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2022-11-18 20:25:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-11-18 20:25:54,126 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-18 20:25:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-11-18 20:25:54,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-18 20:25:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:25:54,132 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-18 20:25:54,133 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-18 20:25:54,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2022-11-18 20:25:54,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-11-18 20:25:54,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:54,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:54,137 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-18 20:25:54,138 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-18 20:25:54,138 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-18 20:25:54,138 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-18 20:25:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2022-11-18 20:25:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:54,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783426332] [2022-11-18 20:25:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2022-11-18 20:25:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:54,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995892266] [2022-11-18 20:25:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:54,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:54,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624756190] [2022-11-18 20:25:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:54,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:54,184 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:54,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-18 20:25:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:54,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:25:54,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:54,292 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-18 20:25:54,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:25:54,392 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-18 20:25:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:25:54,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995892266] [2022-11-18 20:25:54,392 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:25:54,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624756190] [2022-11-18 20:25:54,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624756190] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:25:54,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:25:54,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-18 20:25:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59153145] [2022-11-18 20:25:54,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:25:54,394 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:25:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:25:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:25:54,395 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-18 20:25:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:25:54,577 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2022-11-18 20:25:54,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2022-11-18 20:25:54,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2022-11-18 20:25:54,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2022-11-18 20:25:54,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-11-18 20:25:54,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-11-18 20:25:54,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-18 20:25:54,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:25:54,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-18 20:25:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-18 20:25:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-18 20:25:54,604 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-18 20:25:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2022-11-18 20:25:54,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-18 20:25:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:25:54,608 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-18 20:25:54,609 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-18 20:25:54,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2022-11-18 20:25:54,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2022-11-18 20:25:54,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:54,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:54,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-18 20:25:54,614 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-18 20:25:54,614 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-18 20:25:54,615 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-18 20:25:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2022-11-18 20:25:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:54,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770373108] [2022-11-18 20:25:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2022-11-18 20:25:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:54,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213334217] [2022-11-18 20:25:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:54,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:54,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298729665] [2022-11-18 20:25:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:54,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:54,648 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:54,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-11-18 20:25:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2022-11-18 20:25:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:54,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348520788] [2022-11-18 20:25:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:54,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:54,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014354168] [2022-11-18 20:25:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:54,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:54,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:54,720 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:54,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-11-18 20:25:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:54,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:55,102 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:25:55,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:25:55,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:25:55,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:25:55,103 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:25:55,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:55,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:25:55,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:25:55,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-18 20:25:55,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:25:55,103 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:25:55,105 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-18 20:25:55,109 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-18 20:25:55,131 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-18 20:25:55,133 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-18 20:25:55,136 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-18 20:25:55,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-18 20:25:55,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-18 20:25:55,143 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-18 20:25:55,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:25:55,264 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:25:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:55,272 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:55,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:25:55,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:55,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-11-18 20:25:55,303 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:25:55,303 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-18 20:25:55,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:55,308 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:55,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:25:55,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:55,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-11-18 20:25:55,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-11-18 20:25:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:55,338 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:55,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:25:55,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:25:55,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-11-18 20:25:55,889 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:25:55,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-11-18 20:25:55,893 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:25:55,893 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:25:55,893 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:25:55,893 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:25:55,893 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:25:55,893 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:55,893 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:25:55,893 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:25:55,893 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-18 20:25:55,893 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:25:55,893 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:25:55,895 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-18 20:25: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-18 20:25:55,917 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-18 20:25:55,919 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-18 20:25:55,921 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-18 20:25:55,932 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-18 20:25:55,934 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-18 20:25:55,937 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-18 20:25:56,063 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:25:56,063 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:25:56,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:56,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:56,065 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:56,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-11-18 20:25:56,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:25:56,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:56,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:56,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:56,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:56,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:56,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:56,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:56,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:25:56,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:56,102 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:56,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-11-18 20:25:56,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-18 20:25:56,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:25:56,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:25:56,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:25:56,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:25:56,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:25:56,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:25:56,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:25:56,127 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:25:56,132 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-18 20:25:56,133 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-18 20:25:56,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:25:56,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:56,139 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:25:56,144 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:25:56,144 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:25:56,144 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:25:56,144 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-18 20:25:56,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-11-18 20:25:56,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:56,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:25:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:56,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:25:56,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:56,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:25:56,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:56,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:56,395 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-18 20:25:56,396 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-18 20:25:56,397 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-18 20:25:56,716 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-18 20:25:56,716 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-18 20:25:56,718 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-18 20:25:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-11-18 20:25:56,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2022-11-18 20:25:56,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:25:56,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2022-11-18 20:25:56,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:25:56,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2022-11-18 20:25:56,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:25:56,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2022-11-18 20:25:56,732 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-18 20:25:56,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2022-11-18 20:25:56,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-11-18 20:25:56,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-18 20:25:56,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2022-11-18 20:25:56,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:25:56,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2022-11-18 20:25:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2022-11-18 20:25:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2022-11-18 20:25:56,771 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-18 20:25:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2022-11-18 20:25:56,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-18 20:25:56,776 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-18 20:25:56,777 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-18 20:25:56,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2022-11-18 20:25:56,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-18 20:25:56,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:56,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:56,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-18 20:25:56,782 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-18 20:25:56,782 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-18 20:25:56,782 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-18 20:25:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2022-11-18 20:25:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:56,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062009196] [2022-11-18 20:25:56,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:56,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:56,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 2 times [2022-11-18 20:25:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:56,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735427216] [2022-11-18 20:25:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:56,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:56,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289395008] [2022-11-18 20:25:56,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:25:56,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:56,820 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:56,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-11-18 20:25:56,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:25:56,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:25:56,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:25:56,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:57,036 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-18 20:25:57,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:25:57,320 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-18 20:25:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:25:57,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735427216] [2022-11-18 20:25:57,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:25:57,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289395008] [2022-11-18 20:25:57,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289395008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:25:57,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:25:57,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-18 20:25:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015175161] [2022-11-18 20:25:57,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:25:57,323 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:25:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:25:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:25:57,325 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-18 20:25:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:25:58,255 INFO L93 Difference]: Finished difference Result 284 states and 438 transitions. [2022-11-18 20:25:58,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 438 transitions. [2022-11-18 20:25:58,260 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2022-11-18 20:25:58,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 271 states and 424 transitions. [2022-11-18 20:25:58,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-11-18 20:25:58,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-11-18 20:25:58,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 424 transitions. [2022-11-18 20:25:58,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:25:58,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 424 transitions. [2022-11-18 20:25:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 424 transitions. [2022-11-18 20:25:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2022-11-18 20:25:58,293 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-18 20:25:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2022-11-18 20:25:58,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-18 20:25:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:25:58,296 INFO L428 stractBuchiCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-18 20:25:58,296 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-18 20:25:58,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 236 transitions. [2022-11-18 20:25:58,298 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2022-11-18 20:25:58,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:58,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:58,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-18 20:25:58,300 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-18 20:25:58,300 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-18 20:25:58,300 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-18 20:25:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2022-11-18 20:25:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:58,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818263571] [2022-11-18 20:25:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:58,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:58,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash 885226027, now seen corresponding path program 1 times [2022-11-18 20:25:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:58,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47416805] [2022-11-18 20:25:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:58,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:58,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112117407] [2022-11-18 20:25:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:58,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:58,338 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:58,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-11-18 20:25:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:25:58,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:25:58,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:58,494 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-18 20:25:58,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:25:58,686 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-18 20:25:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:25:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47416805] [2022-11-18 20:25:58,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:25:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112117407] [2022-11-18 20:25:58,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112117407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:25:58,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:25:58,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-18 20:25:58,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272148640] [2022-11-18 20:25:58,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:25:58,690 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:25:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:58,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:25:58,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:25:58,691 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-18 20:25:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:25:59,007 INFO L93 Difference]: Finished difference Result 285 states and 408 transitions. [2022-11-18 20:25:59,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 408 transitions. [2022-11-18 20:25:59,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2022-11-18 20:25:59,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 408 transitions. [2022-11-18 20:25:59,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-11-18 20:25:59,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2022-11-18 20:25:59,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 408 transitions. [2022-11-18 20:25:59,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:25:59,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 408 transitions. [2022-11-18 20:25:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 408 transitions. [2022-11-18 20:25:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2022-11-18 20:25:59,034 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-18 20:25:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2022-11-18 20:25:59,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-18 20:25:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:25:59,037 INFO L428 stractBuchiCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-18 20:25:59,037 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-18 20:25:59,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 252 transitions. [2022-11-18 20:25:59,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2022-11-18 20:25:59,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:25:59,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:25:59,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-18 20:25:59,041 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-18 20:25:59,041 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-18 20:25:59,042 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-18 20:25:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2022-11-18 20:25:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:59,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022644981] [2022-11-18 20:25:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:59,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:25:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:25:59,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:25:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1877972557, now seen corresponding path program 2 times [2022-11-18 20:25:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:25:59,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742837686] [2022-11-18 20:25:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:25:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:25:59,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:25:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954606839] [2022-11-18 20:25:59,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:25:59,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:25:59,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:25:59,067 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:25:59,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-11-18 20:25:59,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:25:59,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:25:59,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:25:59,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:59,281 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-18 20:25:59,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:25:59,609 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-18 20:25:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:25:59,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742837686] [2022-11-18 20:25:59,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:25:59,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954606839] [2022-11-18 20:25:59,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954606839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:25:59,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:25:59,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-18 20:25:59,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174210303] [2022-11-18 20:25:59,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:25:59,611 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:25:59,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:25:59,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:25:59,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:25:59,612 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-18 20:26:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:00,053 INFO L93 Difference]: Finished difference Result 300 states and 489 transitions. [2022-11-18 20:26:00,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 489 transitions. [2022-11-18 20:26:00,060 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 93 [2022-11-18 20:26:00,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 288 states and 477 transitions. [2022-11-18 20:26:00,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-11-18 20:26:00,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2022-11-18 20:26:00,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 477 transitions. [2022-11-18 20:26:00,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:00,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 477 transitions. [2022-11-18 20:26:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 477 transitions. [2022-11-18 20:26:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 251. [2022-11-18 20:26:00,098 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-18 20:26:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 432 transitions. [2022-11-18 20:26:00,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-18 20:26:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:26:00,104 INFO L428 stractBuchiCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-18 20:26:00,104 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-18 20:26:00,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 432 transitions. [2022-11-18 20:26:00,106 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2022-11-18 20:26:00,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:00,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:00,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-18 20:26:00,113 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-18 20:26:00,113 INFO L748 eck$LassoCheckResult]: Stem: 4038#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4012#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; 4013#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4037#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; 4053#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4024#L42-3 [2022-11-18 20:26:00,117 INFO L750 eck$LassoCheckResult]: Loop: 4024#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4098#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; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#68#return; 4085#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4095#factFINAL assume true; 4091#factEXIT >#70#return; 3981#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4149#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#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; 4165#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4154#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4155#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4039#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; 4040#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#68#return; 4049#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#70#return; 4089#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4096#factENTRY ~n := #in~n; 4097#L25 assume ~n <= 0;#res := 1; 4095#factFINAL assume true; 4091#factEXIT >#72#return; 4027#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; 4028#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4167#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4056#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; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#74#return; 4083#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#76#return; 4054#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4149#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#78#return; 4014#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; 4015#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 4057#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4055#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4034#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4023#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4024#L42-3 [2022-11-18 20:26:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2022-11-18 20:26:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:00,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200225738] [2022-11-18 20:26:00,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:00,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:00,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:00,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash -77194901, now seen corresponding path program 3 times [2022-11-18 20:26:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:00,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959745850] [2022-11-18 20:26:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:00,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402387297] [2022-11-18 20:26:00,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:26:00,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:00,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:00,163 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:00,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-11-18 20:26:00,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-18 20:26:00,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:00,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:26:00,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:00,437 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-18 20:26:00,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:00,828 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-18 20:26:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:00,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959745850] [2022-11-18 20:26:00,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:00,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402387297] [2022-11-18 20:26:00,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402387297] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:00,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:00,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-11-18 20:26:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529894560] [2022-11-18 20:26:00,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:00,830 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:26:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:26:00,831 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-18 20:26:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:02,399 INFO L93 Difference]: Finished difference Result 673 states and 1222 transitions. [2022-11-18 20:26:02,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1222 transitions. [2022-11-18 20:26:02,409 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 248 [2022-11-18 20:26:02,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 667 states and 1216 transitions. [2022-11-18 20:26:02,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2022-11-18 20:26:02,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2022-11-18 20:26:02,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 1216 transitions. [2022-11-18 20:26:02,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:02,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 667 states and 1216 transitions. [2022-11-18 20:26:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 1216 transitions. [2022-11-18 20:26:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 292. [2022-11-18 20:26:02,466 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-18 20:26:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 520 transitions. [2022-11-18 20:26:02,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 292 states and 520 transitions. [2022-11-18 20:26:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:26:02,470 INFO L428 stractBuchiCegarLoop]: Abstraction has 292 states and 520 transitions. [2022-11-18 20:26:02,470 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-18 20:26:02,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 520 transitions. [2022-11-18 20:26:02,473 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 89 [2022-11-18 20:26:02,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:02,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:02,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-18 20:26:02,475 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-18 20:26:02,475 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; 5680#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5652#L42-3 [2022-11-18 20:26:02,476 INFO L750 eck$LassoCheckResult]: Loop: 5652#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5732#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; 5691#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5711#factENTRY ~n := #in~n; 5717#L25 assume !(~n <= 0); 5718#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume !(~n <= 0); 5724#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume ~n <= 0;#res := 1; 5729#factFINAL assume true; 5726#factEXIT >#66#return; 5725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5731#factFINAL assume true; 5723#factEXIT >#66#return; 5721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5720#factFINAL assume true; 5688#factEXIT >#68#return; 5702#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5711#factENTRY ~n := #in~n; 5717#L25 assume ~n <= 0;#res := 1; 5714#factFINAL assume true; 5712#factEXIT >#70#return; 5698#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5708#factENTRY ~n := #in~n; 5728#L25 assume !(~n <= 0); 5718#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume ~n <= 0;#res := 1; 5729#factFINAL assume true; 5726#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5709#factFINAL assume true; 5710#factEXIT >#72#return; 5716#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; 5694#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5711#factENTRY ~n := #in~n; 5717#L25 assume !(~n <= 0); 5718#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume !(~n <= 0); 5724#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume ~n <= 0;#res := 1; 5729#factFINAL assume true; 5726#factEXIT >#66#return; 5725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5731#factFINAL assume true; 5723#factEXIT >#66#return; 5721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5720#factFINAL assume true; 5688#factEXIT >#68#return; 5689#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5711#factENTRY ~n := #in~n; 5717#L25 assume !(~n <= 0); 5718#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume !(~n <= 0); 5724#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume ~n <= 0;#res := 1; 5729#factFINAL assume true; 5726#factEXIT >#66#return; 5725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5731#factFINAL assume true; 5723#factEXIT >#66#return; 5721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5720#factFINAL assume true; 5688#factEXIT >#70#return; 5704#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5715#factENTRY ~n := #in~n; 5719#L25 assume ~n <= 0;#res := 1; 5714#factFINAL assume true; 5712#factEXIT >#72#return; 5713#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; 5751#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5744#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5682#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);< 5711#factENTRY ~n := #in~n; 5717#L25 assume !(~n <= 0); 5718#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume !(~n <= 0); 5724#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume ~n <= 0;#res := 1; 5729#factFINAL assume true; 5726#factEXIT >#66#return; 5725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5731#factFINAL assume true; 5723#factEXIT >#66#return; 5721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5720#factFINAL assume true; 5688#factEXIT >#74#return; 5700#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5711#factENTRY ~n := #in~n; 5717#L25 assume ~n <= 0;#res := 1; 5714#factFINAL assume true; 5712#factEXIT >#76#return; 5693#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5708#factENTRY ~n := #in~n; 5728#L25 assume !(~n <= 0); 5718#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume !(~n <= 0); 5724#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5730#L25 assume ~n <= 0;#res := 1; 5729#factFINAL assume true; 5726#factEXIT >#66#return; 5725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5731#factFINAL assume true; 5723#factEXIT >#66#return; 5721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5720#factFINAL assume true; 5688#factEXIT >#78#return; 5687#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; 5686#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 5683#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5681#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-18 20:26:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:02,477 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2022-11-18 20:26:02,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:02,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826102511] [2022-11-18 20:26:02,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:02,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:02,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:02,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1233557403, now seen corresponding path program 4 times [2022-11-18 20:26:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:02,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829422964] [2022-11-18 20:26:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:02,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:02,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313653164] [2022-11-18 20:26:02,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:26:02,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:02,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:02,499 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:02,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-11-18 20:26:02,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:26:02,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:02,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:26:02,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:02,689 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-18 20:26:02,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:03,084 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-18 20:26:03,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:03,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829422964] [2022-11-18 20:26:03,085 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:03,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313653164] [2022-11-18 20:26:03,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313653164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:03,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:03,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2022-11-18 20:26:03,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196790988] [2022-11-18 20:26:03,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:03,086 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:03,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:26:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:26:03,087 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-18 20:26:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:03,504 INFO L93 Difference]: Finished difference Result 527 states and 864 transitions. [2022-11-18 20:26:03,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 527 states and 864 transitions. [2022-11-18 20:26:03,510 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2022-11-18 20:26:03,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 527 states to 527 states and 864 transitions. [2022-11-18 20:26:03,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2022-11-18 20:26:03,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2022-11-18 20:26:03,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 527 states and 864 transitions. [2022-11-18 20:26:03,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:03,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 527 states and 864 transitions. [2022-11-18 20:26:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states and 864 transitions. [2022-11-18 20:26:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 325. [2022-11-18 20:26:03,533 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-18 20:26:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 586 transitions. [2022-11-18 20:26:03,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 325 states and 586 transitions. [2022-11-18 20:26:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:26:03,537 INFO L428 stractBuchiCegarLoop]: Abstraction has 325 states and 586 transitions. [2022-11-18 20:26:03,537 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-18 20:26:03,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 325 states and 586 transitions. [2022-11-18 20:26:03,540 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 97 [2022-11-18 20:26:03,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:03,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:03,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-18 20:26:03,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 13, 13, 13, 13, 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-18 20:26:03,542 INFO L748 eck$LassoCheckResult]: Stem: 7291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7269#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; 7270#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7290#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; 7304#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7280#L42-3 [2022-11-18 20:26:03,542 INFO L750 eck$LassoCheckResult]: Loop: 7280#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7355#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; 7317#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7338#factENTRY ~n := #in~n; 7362#L25 assume !(~n <= 0); 7351#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume !(~n <= 0); 7350#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume ~n <= 0;#res := 1; 7360#factFINAL assume true; 7357#factEXIT >#66#return; 7354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7365#factFINAL assume true; 7349#factEXIT >#66#return; 7348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7347#factFINAL assume true; 7313#factEXIT >#68#return; 7318#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7338#factENTRY ~n := #in~n; 7362#L25 assume ~n <= 0;#res := 1; 7343#factFINAL assume true; 7341#factEXIT >#70#return; 7315#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7335#factENTRY ~n := #in~n; 7364#L25 assume !(~n <= 0); 7353#L26 call #t~ret0 := fact(~n - 1);< 7274#factENTRY ~n := #in~n; 7370#L25 assume !(~n <= 0); 7350#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume ~n <= 0;#res := 1; 7360#factFINAL assume true; 7357#factEXIT >#66#return; 7354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7365#factFINAL assume true; 7349#factEXIT >#66#return; 7348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7347#factFINAL assume true; 7313#factEXIT >#72#return; 7331#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; 7374#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7371#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7368#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7366#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; 7314#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7338#factENTRY ~n := #in~n; 7362#L25 assume !(~n <= 0); 7351#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume ~n <= 0;#res := 1; 7360#factFINAL assume true; 7357#factEXIT >#66#return; 7356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7336#factFINAL assume true; 7337#factEXIT >#68#return; 7321#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7338#factENTRY ~n := #in~n; 7362#L25 assume !(~n <= 0); 7351#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume !(~n <= 0); 7350#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume ~n <= 0;#res := 1; 7360#factFINAL assume true; 7357#factEXIT >#66#return; 7354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7365#factFINAL assume true; 7349#factEXIT >#66#return; 7348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7347#factFINAL assume true; 7313#factEXIT >#70#return; 7319#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7338#factENTRY ~n := #in~n; 7362#L25 assume !(~n <= 0); 7351#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume !(~n <= 0); 7350#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume ~n <= 0;#res := 1; 7360#factFINAL assume true; 7357#factEXIT >#66#return; 7354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7365#factFINAL assume true; 7349#factEXIT >#66#return; 7348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7347#factFINAL assume true; 7313#factEXIT >#72#return; 7332#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; 7376#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7373#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7369#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7367#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; 7307#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7338#factENTRY ~n := #in~n; 7362#L25 assume !(~n <= 0); 7351#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume !(~n <= 0); 7350#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume ~n <= 0;#res := 1; 7360#factFINAL assume true; 7357#factEXIT >#66#return; 7354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7365#factFINAL assume true; 7349#factEXIT >#66#return; 7348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7347#factFINAL assume true; 7313#factEXIT >#74#return; 7323#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7338#factENTRY ~n := #in~n; 7362#L25 assume ~n <= 0;#res := 1; 7343#factFINAL assume true; 7341#factEXIT >#76#return; 7328#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7335#factENTRY ~n := #in~n; 7364#L25 assume !(~n <= 0); 7353#L26 call #t~ret0 := fact(~n - 1);< 7274#factENTRY ~n := #in~n; 7370#L25 assume !(~n <= 0); 7350#L26 call #t~ret0 := fact(~n - 1);< 7359#factENTRY ~n := #in~n; 7363#L25 assume ~n <= 0;#res := 1; 7360#factFINAL assume true; 7357#factEXIT >#66#return; 7354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7365#factFINAL assume true; 7349#factEXIT >#66#return; 7348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7347#factFINAL assume true; 7313#factEXIT >#78#return; 7312#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; 7311#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 7310#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7309#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 7283#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7279#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7280#L42-3 [2022-11-18 20:26:03,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:03,543 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 6 times [2022-11-18 20:26:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:03,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263036173] [2022-11-18 20:26:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:03,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:03,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 193284251, now seen corresponding path program 5 times [2022-11-18 20:26:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:03,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670797151] [2022-11-18 20:26:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:03,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:03,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337303221] [2022-11-18 20:26:03,562 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:26:03,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:03,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:03,567 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:03,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-11-18 20:26:03,697 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-11-18 20:26:03,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:03,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 20:26:03,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 642 proven. 140 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-11-18 20:26:03,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 150 proven. 335 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-18 20:26:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670797151] [2022-11-18 20:26:04,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:04,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337303221] [2022-11-18 20:26:04,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337303221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:04,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:04,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 22 [2022-11-18 20:26:04,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321691453] [2022-11-18 20:26:04,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:04,560 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:26:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:26:04,561 INFO L87 Difference]: Start difference. First operand 325 states and 586 transitions. cyclomatic complexity: 269 Second operand has 22 states, 15 states have (on average 3.533333333333333) internal successors, (53), 18 states have internal predecessors, (53), 15 states have call successors, (24), 2 states have call predecessors, (24), 7 states have return successors, (26), 14 states have call predecessors, (26), 15 states have call successors, (26) [2022-11-18 20:26:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:05,830 INFO L93 Difference]: Finished difference Result 706 states and 1261 transitions. [2022-11-18 20:26:05,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 706 states and 1261 transitions. [2022-11-18 20:26:05,839 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 214 [2022-11-18 20:26:05,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 706 states to 706 states and 1261 transitions. [2022-11-18 20:26:05,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2022-11-18 20:26:05,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2022-11-18 20:26:05,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 706 states and 1261 transitions. [2022-11-18 20:26:05,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:05,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 706 states and 1261 transitions. [2022-11-18 20:26:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states and 1261 transitions. [2022-11-18 20:26:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 466. [2022-11-18 20:26:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 281 states have (on average 1.1387900355871887) internal successors, (320), 271 states have internal predecessors, (320), 163 states have call successors, (163), 36 states have call predecessors, (163), 22 states have return successors, (459), 158 states have call predecessors, (459), 163 states have call successors, (459) [2022-11-18 20:26:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 942 transitions. [2022-11-18 20:26:05,879 INFO L240 hiAutomatonCegarLoop]: Abstraction has 466 states and 942 transitions. [2022-11-18 20:26:05,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:26:05,880 INFO L428 stractBuchiCegarLoop]: Abstraction has 466 states and 942 transitions. [2022-11-18 20:26:05,880 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-18 20:26:05,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 466 states and 942 transitions. [2022-11-18 20:26:05,884 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 128 [2022-11-18 20:26:05,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:05,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:05,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:05,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-18 20:26:05,885 INFO L748 eck$LassoCheckResult]: Stem: 9264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9233#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; 9234#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9263#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; 9283#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9419#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9413#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; 9321#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9367#factENTRY ~n := #in~n; 9412#L25 assume ~n <= 0;#res := 1; 9376#factFINAL assume true; 9377#factEXIT >#68#return; 9307#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9390#factENTRY ~n := #in~n; 9384#L25 assume !(~n <= 0); 9137#L26 call #t~ret0 := fact(~n - 1);< 9353#factENTRY [2022-11-18 20:26:05,885 INFO L750 eck$LassoCheckResult]: Loop: 9353#factENTRY ~n := #in~n; 9354#L25 assume !(~n <= 0); 9138#L26 call #t~ret0 := fact(~n - 1);< 9353#factENTRY [2022-11-18 20:26:05,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 960037668, now seen corresponding path program 1 times [2022-11-18 20:26:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:05,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587579066] [2022-11-18 20:26:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:26:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:26:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:05,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587579066] [2022-11-18 20:26:05,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587579066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:26:05,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:26:05,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:26:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886192765] [2022-11-18 20:26:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:26:05,963 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:05,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2022-11-18 20:26:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:05,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101058879] [2022-11-18 20:26:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:05,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:05,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:05,995 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:05,995 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:05,995 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:05,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:05,995 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:26:05,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:05,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:05,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:05,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-18 20:26:05,996 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:05,996 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:05,997 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-18 20:26:06,000 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-18 20:26:06,002 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-18 20:26:06,007 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-18 20:26:06,032 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:06,033 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:26:06,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,039 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:06,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:06,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-11-18 20:26:06,066 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:06,066 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-18 20:26:06,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:06,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,072 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:06,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:06,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-11-18 20:26:06,100 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:06,100 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-18 20:26:06,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-11-18 20:26:06,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,104 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-11-18 20:26:06,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:06,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:06,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-11-18 20:26:06,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,121 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-11-18 20:26:06,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:26:06,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:06,150 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:26:06,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-11-18 20:26:06,153 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:06,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:06,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:06,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:06,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:26:06,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:06,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:06,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-18 20:26:06,153 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:06,153 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:06,154 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-18 20:26:06,159 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-18 20:26:06,164 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-18 20:26:06,170 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-18 20:26:06,190 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:06,190 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:26:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,191 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-11-18 20:26:06,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:06,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:06,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:06,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:06,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:06,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:06,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:06,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:06,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:06,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:06,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,210 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-11-18 20:26:06,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:06,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:06,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:06,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:06,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:06,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:06,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:06,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:06,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:06,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:06,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,228 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-11-18 20:26:06,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:06,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:06,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:06,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:06,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:06,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:06,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:06,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:06,250 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:26:06,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-18 20:26:06,253 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-18 20:26:06,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,255 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-11-18 20:26:06,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:26:06,258 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:26:06,258 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:26:06,258 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-18 20:26:06,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-11-18 20:26:06,261 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:26:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:06,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:26:06,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:06,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:26:06,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:06,408 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-18 20:26:06,409 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-18 20:26:06,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 466 states and 942 transitions. cyclomatic complexity: 485 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:26:06,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 466 states and 942 transitions. cyclomatic complexity: 485. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 584 states and 1152 transitions. Complement of second has 13 states. [2022-11-18 20:26:06,524 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-18 20:26:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:26:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-18 20:26:06,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 3 letters. [2022-11-18 20:26:06,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:06,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 19 letters. Loop has 3 letters. [2022-11-18 20:26:06,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:06,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 16 letters. Loop has 6 letters. [2022-11-18 20:26:06,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:06,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 1152 transitions. [2022-11-18 20:26:06,534 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 136 [2022-11-18 20:26:06,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 568 states and 1132 transitions. [2022-11-18 20:26:06,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2022-11-18 20:26:06,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2022-11-18 20:26:06,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 568 states and 1132 transitions. [2022-11-18 20:26:06,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:06,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 568 states and 1132 transitions. [2022-11-18 20:26:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states and 1132 transitions. [2022-11-18 20:26:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 560. [2022-11-18 20:26:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 339 states have (on average 1.1563421828908556) internal successors, (392), 333 states have internal predecessors, (392), 191 states have call successors, (191), 54 states have call predecessors, (191), 30 states have return successors, (535), 172 states have call predecessors, (535), 191 states have call successors, (535) [2022-11-18 20:26:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1118 transitions. [2022-11-18 20:26:06,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 560 states and 1118 transitions. [2022-11-18 20:26:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:26:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:26:06,573 INFO L87 Difference]: Start difference. First operand 560 states and 1118 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:26:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:06,671 INFO L93 Difference]: Finished difference Result 663 states and 1249 transitions. [2022-11-18 20:26:06,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 663 states and 1249 transitions. [2022-11-18 20:26:06,679 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 154 [2022-11-18 20:26:06,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:06,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 663 states to 663 states and 1249 transitions. [2022-11-18 20:26:06,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2022-11-18 20:26:06,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2022-11-18 20:26:06,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 663 states and 1249 transitions. [2022-11-18 20:26:06,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:06,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 663 states and 1249 transitions. [2022-11-18 20:26:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states and 1249 transitions. [2022-11-18 20:26:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 584. [2022-11-18 20:26:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 357 states have (on average 1.1484593837535013) internal successors, (410), 351 states have internal predecessors, (410), 191 states have call successors, (191), 60 states have call predecessors, (191), 36 states have return successors, (535), 172 states have call predecessors, (535), 191 states have call successors, (535) [2022-11-18 20:26:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1136 transitions. [2022-11-18 20:26:06,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 584 states and 1136 transitions. [2022-11-18 20:26:06,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:26:06,740 INFO L428 stractBuchiCegarLoop]: Abstraction has 584 states and 1136 transitions. [2022-11-18 20:26:06,740 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-18 20:26:06,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 584 states and 1136 transitions. [2022-11-18 20:26:06,744 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 136 [2022-11-18 20:26:06,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:06,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:06,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:06,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 12, 12, 12, 12, 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-18 20:26:06,747 INFO L748 eck$LassoCheckResult]: Stem: 11561#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11532#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; 11533#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 11560#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; 11632#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 11710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11707#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; 11521#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11522#factENTRY ~n := #in~n; 11763#L25 assume !(~n <= 0); 11539#L26 call #t~ret0 := fact(~n - 1);< 11761#factENTRY ~n := #in~n; 11752#L25 assume ~n <= 0;#res := 1; 11718#factFINAL assume true; 11713#factEXIT >#66#return; 11711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11708#factFINAL assume true; 11701#factEXIT >#68#return; 11703#L30-1 [2022-11-18 20:26:06,748 INFO L750 eck$LassoCheckResult]: Loop: 11703#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11722#factENTRY ~n := #in~n; 11724#L25 assume ~n <= 0;#res := 1; 11723#factFINAL assume true; 11720#factEXIT >#70#return; 11666#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 11709#factENTRY ~n := #in~n; 11754#L25 assume !(~n <= 0); 11735#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume !(~n <= 0); 11734#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume !(~n <= 0); 11734#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11771#factFINAL assume true; 11739#factEXIT >#66#return; 11736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11746#factFINAL assume true; 11729#factEXIT >#66#return; 11725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11726#factFINAL assume true; 11654#factEXIT >#72#return; 11680#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; 11971#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 11936#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11893#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11745#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; 11692#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11698#factENTRY ~n := #in~n; 11808#L25 assume !(~n <= 0); 11740#L26 call #t~ret0 := fact(~n - 1);< 11743#factENTRY ~n := #in~n; 11794#L25 assume !(~n <= 0); 11759#L26 call #t~ret0 := fact(~n - 1);< 11717#factENTRY ~n := #in~n; 11769#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11771#factFINAL assume true; 11739#factEXIT >#66#return; 11727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11689#factFINAL assume true; 11693#factEXIT >#68#return; 11655#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11506#factENTRY ~n := #in~n; 11755#L25 assume !(~n <= 0); 11735#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11708#factFINAL assume true; 11701#factEXIT >#70#return; 11676#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 11700#factENTRY ~n := #in~n; 11811#L25 assume !(~n <= 0); 11716#L26 call #t~ret0 := fact(~n - 1);< 11717#factENTRY ~n := #in~n; 11769#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11708#factFINAL assume true; 11701#factEXIT >#72#return; 11696#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; 11822#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 11820#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11809#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11638#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; 11505#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11506#factENTRY ~n := #in~n; 11755#L25 assume !(~n <= 0); 11735#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume !(~n <= 0); 11734#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11771#factFINAL assume true; 11739#factEXIT >#66#return; 11727#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11689#factFINAL assume true; 11693#factEXIT >#74#return; 11672#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11506#factENTRY ~n := #in~n; 11755#L25 assume !(~n <= 0); 11735#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11708#factFINAL assume true; 11701#factEXIT >#76#return; 11684#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 11653#factENTRY ~n := #in~n; 11812#L25 assume !(~n <= 0); 11716#L26 call #t~ret0 := fact(~n - 1);< 11717#factENTRY ~n := #in~n; 11769#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11708#factFINAL assume true; 11701#factEXIT >#78#return; 11677#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; 11641#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 11642#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11637#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 11558#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 11549#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 11550#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11756#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; 11668#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11506#factENTRY ~n := #in~n; 11755#L25 assume !(~n <= 0); 11735#L26 call #t~ret0 := fact(~n - 1);< 11738#factENTRY ~n := #in~n; 11777#L25 assume ~n <= 0;#res := 1; 11768#factFINAL assume true; 11758#factEXIT >#66#return; 11711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11708#factFINAL assume true; 11701#factEXIT >#68#return; 11703#L30-1 [2022-11-18 20:26:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1862517908, now seen corresponding path program 1 times [2022-11-18 20:26:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:06,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083348361] [2022-11-18 20:26:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:06,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:06,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006356097] [2022-11-18 20:26:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:06,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:06,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,772 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-11-18 20:26:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:06,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:26:06,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:26:06,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:26:06,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:06,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083348361] [2022-11-18 20:26:06,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:06,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006356097] [2022-11-18 20:26:06,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006356097] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:06,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:06,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-11-18 20:26:06,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930345862] [2022-11-18 20:26:06,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:06,917 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash 378331819, now seen corresponding path program 6 times [2022-11-18 20:26:06,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:06,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730747873] [2022-11-18 20:26:06,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:06,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:06,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417492213] [2022-11-18 20:26:06,930 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:26:06,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:06,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:06,933 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:06,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-11-18 20:26:07,016 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-18 20:26:07,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:07,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:26:07,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 615 proven. 38 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-11-18 20:26:07,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 201 proven. 156 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2022-11-18 20:26:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730747873] [2022-11-18 20:26:07,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417492213] [2022-11-18 20:26:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417492213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:07,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:07,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 18 [2022-11-18 20:26:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146443668] [2022-11-18 20:26:07,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:07,679 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:26:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:26:07,680 INFO L87 Difference]: Start difference. First operand 584 states and 1136 transitions. cyclomatic complexity: 565 Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:26:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:07,830 INFO L93 Difference]: Finished difference Result 649 states and 1282 transitions. [2022-11-18 20:26:07,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 649 states and 1282 transitions. [2022-11-18 20:26:07,838 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 164 [2022-11-18 20:26:07,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 649 states to 637 states and 1254 transitions. [2022-11-18 20:26:07,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2022-11-18 20:26:07,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2022-11-18 20:26:07,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 637 states and 1254 transitions. [2022-11-18 20:26:07,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:07,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 637 states and 1254 transitions. [2022-11-18 20:26:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states and 1254 transitions. [2022-11-18 20:26:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 627. [2022-11-18 20:26:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 377 states have (on average 1.1405835543766578) internal successors, (430), 370 states have internal predecessors, (430), 214 states have call successors, (214), 54 states have call predecessors, (214), 36 states have return successors, (598), 202 states have call predecessors, (598), 214 states have call successors, (598) [2022-11-18 20:26:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1242 transitions. [2022-11-18 20:26:07,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 627 states and 1242 transitions. [2022-11-18 20:26:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:26:07,902 INFO L428 stractBuchiCegarLoop]: Abstraction has 627 states and 1242 transitions. [2022-11-18 20:26:07,902 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-18 20:26:07,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 627 states and 1242 transitions. [2022-11-18 20:26:07,906 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 161 [2022-11-18 20:26:07,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:07,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:07,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:07,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:07,908 INFO L748 eck$LassoCheckResult]: Stem: 13736#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13709#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; 13710#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 13735#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; 13773#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13914#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13911#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; 13906#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13907#factENTRY ~n := #in~n; 13913#L25 assume ~n <= 0;#res := 1; 13910#factFINAL assume true; 13905#factEXIT >#68#return; 13901#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13902#factENTRY ~n := #in~n; 13909#L25 assume ~n <= 0;#res := 1; 13904#factFINAL assume true; 13900#factEXIT >#70#return; 13854#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13892#factENTRY ~n := #in~n; 13893#L25 assume ~n <= 0;#res := 1; 13917#factFINAL assume true; 13895#factEXIT >#72#return; 13898#L30-3 [2022-11-18 20:26:07,908 INFO L750 eck$LassoCheckResult]: Loop: 13898#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; 13915#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 13912#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13908#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13903#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; 13896#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13899#factENTRY ~n := #in~n; 13918#L25 assume ~n <= 0;#res := 1; 13917#factFINAL assume true; 13895#factEXIT >#68#return; 13846#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13892#factENTRY ~n := #in~n; 13893#L25 assume ~n <= 0;#res := 1; 13917#factFINAL assume true; 13895#factEXIT >#70#return; 13897#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13899#factENTRY ~n := #in~n; 13918#L25 assume ~n <= 0;#res := 1; 13917#factFINAL assume true; 13895#factEXIT >#72#return; 13898#L30-3 [2022-11-18 20:26:07,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash -455324880, now seen corresponding path program 1 times [2022-11-18 20:26:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:07,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486217265] [2022-11-18 20:26:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:07,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:07,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:07,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:07,923 INFO L85 PathProgramCache]: Analyzing trace with hash 467014384, now seen corresponding path program 1 times [2022-11-18 20:26:07,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:07,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573732971] [2022-11-18 20:26:07,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:07,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:07,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122115749] [2022-11-18 20:26:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:07,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:07,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:07,931 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:07,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-11-18 20:26:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:07,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:08,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 448000159, now seen corresponding path program 1 times [2022-11-18 20:26:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:08,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154841158] [2022-11-18 20:26:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:08,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:08,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:08,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441701203] [2022-11-18 20:26:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:08,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:08,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:08,015 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:08,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-11-18 20:26:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:08,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:26:08,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:08,119 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-18 20:26:08,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:26:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154841158] [2022-11-18 20:26:08,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441701203] [2022-11-18 20:26:08,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441701203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:26:08,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:26:08,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:26:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340046149] [2022-11-18 20:26:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:26:08,449 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:08,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:08,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:08,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:08,449 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:26:08,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:08,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:08,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:08,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-18 20:26:08,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:08,449 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:08,450 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-18 20:26:08,463 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-18 20:26:08,466 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-18 20:26:08,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-18 20:26:08,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-18 20:26:08,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-18 20:26:08,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-18 20:26:08,594 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:08,594 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:26:08,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:08,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:08,599 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:08,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-11-18 20:26:08,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:08,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:08,614 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:08,614 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-18 20:26:08,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:08,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:08,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:08,618 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:08,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-11-18 20:26:08,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:08,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:08,632 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:08,633 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-18 20:26:08,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:08,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:08,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:08,636 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:08,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-11-18 20:26:08,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:08,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:08,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:08,650 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-18 20:26:08,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:08,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:08,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:08,655 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:08,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-11-18 20:26:08,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:08,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:08,670 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:08,670 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-18 20:26:08,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-11-18 20:26:08,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:08,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:08,673 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:08,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-11-18 20:26:08,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:08,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:08,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-11-18 20:26:08,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:08,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:08,693 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:08,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-11-18 20:26:08,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:26:08,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:09,175 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:26:09,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-11-18 20:26:09,180 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:09,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:09,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:09,180 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:09,180 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:26:09,180 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:09,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:09,180 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-18 20:26:09,180 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:09,180 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:09,181 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-18 20:26:09,183 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-18 20:26:09,185 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-18 20:26:09,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-18 20:26:09,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-18 20:26:09,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-18 20:26:09,216 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-18 20:26:09,310 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:09,310 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:26:09,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:09,312 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:09,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:09,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:09,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:09,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:09,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:09,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:09,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:09,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:09,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-11-18 20:26:09,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:09,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-11-18 20:26:09,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:09,350 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:09,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-11-18 20:26:09,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:09,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:09,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:09,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:09,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:09,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:09,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:09,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:09,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:09,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-11-18 20:26:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:09,369 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:09,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-11-18 20:26:09,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:09,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:09,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:09,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:09,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:09,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:09,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:09,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:09,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:09,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-11-18 20:26:09,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:09,394 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:09,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-11-18 20:26:09,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:09,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:09,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:09,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:09,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:09,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:09,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:09,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:09,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:09,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-11-18 20:26:09,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:09,411 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:09,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-11-18 20:26:09,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:26:09,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:09,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:09,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:09,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:09,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:09,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:09,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:09,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:09,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:09,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:09,433 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:09,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-11-18 20:26:09,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:09,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:09,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:09,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:09,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:09,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:09,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:09,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:09,451 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:26:09,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-18 20:26:09,456 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-18 20:26:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:09,457 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:09,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-11-18 20:26:09,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:26:09,460 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:26:09,460 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:26:09,460 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-18 20:26:09,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:09,465 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:26:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:09,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:26:09,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:09,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 20:26:09,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:09,781 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-18 20:26:09,781 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-18 20:26:09,781 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 627 states and 1242 transitions. cyclomatic complexity: 632 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-18 20:26:10,012 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 627 states and 1242 transitions. cyclomatic complexity: 632. 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 1203 states and 2057 transitions. Complement of second has 35 states. [2022-11-18 20:26:10,012 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-18 20:26:10,043 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-18 20:26:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-11-18 20:26:10,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 22 letters. Loop has 20 letters. [2022-11-18 20:26:10,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:10,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 42 letters. Loop has 20 letters. [2022-11-18 20:26:10,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:10,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 64 transitions. Stem has 22 letters. Loop has 40 letters. [2022-11-18 20:26:10,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:10,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 2057 transitions. [2022-11-18 20:26:10,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:10,063 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 143 [2022-11-18 20:26:10,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 1165 states and 1993 transitions. [2022-11-18 20:26:10,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 391 [2022-11-18 20:26:10,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2022-11-18 20:26:10,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1165 states and 1993 transitions. [2022-11-18 20:26:10,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:10,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1165 states and 1993 transitions. [2022-11-18 20:26:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states and 1993 transitions. [2022-11-18 20:26:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1075. [2022-11-18 20:26:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 673 states have (on average 1.138187221396731) internal successors, (766), 660 states have internal predecessors, (766), 294 states have call successors, (304), 130 states have call predecessors, (304), 108 states have return successors, (786), 284 states have call predecessors, (786), 294 states have call successors, (786) [2022-11-18 20:26:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1856 transitions. [2022-11-18 20:26:10,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1075 states and 1856 transitions. [2022-11-18 20:26:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:26:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:26:10,123 INFO L87 Difference]: Start difference. First operand 1075 states and 1856 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-18 20:26:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:10,169 INFO L93 Difference]: Finished difference Result 986 states and 1697 transitions. [2022-11-18 20:26:10,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 986 states and 1697 transitions. [2022-11-18 20:26:10,180 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 143 [2022-11-18 20:26:10,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 986 states to 986 states and 1697 transitions. [2022-11-18 20:26:10,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 353 [2022-11-18 20:26:10,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 353 [2022-11-18 20:26:10,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 986 states and 1697 transitions. [2022-11-18 20:26:10,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:10,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 986 states and 1697 transitions. [2022-11-18 20:26:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states and 1697 transitions. [2022-11-18 20:26:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 965. [2022-11-18 20:26:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 601 states have (on average 1.1281198003327788) internal successors, (678), 606 states have internal predecessors, (678), 266 states have call successors, (270), 110 states have call predecessors, (270), 98 states have return successors, (726), 248 states have call predecessors, (726), 266 states have call successors, (726) [2022-11-18 20:26:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1674 transitions. [2022-11-18 20:26:10,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 965 states and 1674 transitions. [2022-11-18 20:26:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:26:10,236 INFO L428 stractBuchiCegarLoop]: Abstraction has 965 states and 1674 transitions. [2022-11-18 20:26:10,236 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-18 20:26:10,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 965 states and 1674 transitions. [2022-11-18 20:26:10,242 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 143 [2022-11-18 20:26:10,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:10,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:10,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:10,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:10,246 INFO L748 eck$LassoCheckResult]: Stem: 17955#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17925#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; 17926#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 17954#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; 17939#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17940#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18259#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; 17899#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17900#factENTRY ~n := #in~n; 18218#L25 assume ~n <= 0;#res := 1; 18215#factFINAL assume true; 18214#factEXIT >#68#return; 18204#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18205#factENTRY ~n := #in~n; 18213#L25 assume ~n <= 0;#res := 1; 18212#factFINAL assume true; 18203#factEXIT >#70#return; 17895#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17896#factENTRY ~n := #in~n; 18667#L25 assume !(~n <= 0); 17959#L26 call #t~ret0 := fact(~n - 1);< 18692#factENTRY ~n := #in~n; 17966#L25 assume ~n <= 0;#res := 1; 17967#factFINAL assume true; 18691#factEXIT >#66#return; 18680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18674#factFINAL assume true; 18668#factEXIT >#72#return; 18662#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; 18659#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17936#L42-2 [2022-11-18 20:26:10,246 INFO L750 eck$LassoCheckResult]: Loop: 17936#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18267#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18051#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; 18052#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17976#factENTRY ~n := #in~n; 18656#L25 assume !(~n <= 0); 17909#L26 call #t~ret0 := fact(~n - 1);< 17921#factENTRY ~n := #in~n; 17922#L25 assume ~n <= 0;#res := 1; 17903#factFINAL assume true; 17910#factEXIT >#66#return; 18677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18741#factFINAL assume true; 18738#factEXIT >#74#return; 18630#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17976#factENTRY ~n := #in~n; 18656#L25 assume ~n <= 0;#res := 1; 18655#factFINAL assume true; 18654#factEXIT >#76#return; 18632#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18739#factENTRY ~n := #in~n; 18744#L25 assume !(~n <= 0); 17909#L26 call #t~ret0 := fact(~n - 1);< 17921#factENTRY ~n := #in~n; 17922#L25 assume ~n <= 0;#res := 1; 17903#factFINAL assume true; 17910#factEXIT >#66#return; 18677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18741#factFINAL assume true; 18738#factEXIT >#78#return; 18056#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; 17935#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 17936#L42-2 [2022-11-18 20:26:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2003240026, now seen corresponding path program 1 times [2022-11-18 20:26:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825675203] [2022-11-18 20:26:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:10,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:10,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551034817] [2022-11-18 20:26:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:10,258 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:10,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-11-18 20:26:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:10,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:26:10,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-18 20:26:10,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-18 20:26:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825675203] [2022-11-18 20:26:10,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551034817] [2022-11-18 20:26:10,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551034817] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:10,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:10,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-11-18 20:26:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044578825] [2022-11-18 20:26:10,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:10,467 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1529841084, now seen corresponding path program 1 times [2022-11-18 20:26:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:10,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093634583] [2022-11-18 20:26:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:10,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979280468] [2022-11-18 20:26:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:10,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:10,474 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:10,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-11-18 20:26:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:10,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:10,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:11,043 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:11,043 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:11,043 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:11,043 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:11,043 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:26:11,043 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,043 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:11,043 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:11,043 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-18 20:26:11,043 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:11,044 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:11,044 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-18 20:26:11,046 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-18 20:26:11,048 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-18 20:26:11,092 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-18 20:26:11,094 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-18 20:26:11,095 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-18 20:26:11,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:11,264 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:26:11,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:11,269 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:11,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-11-18 20:26:11,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:11,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:11,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:11,282 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-18 20:26:11,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:11,286 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:11,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:11,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:11,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-11-18 20:26:11,305 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:11,305 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-18 20:26:11,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-11-18 20:26:11,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:11,309 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:11,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:11,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:11,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-11-18 20:26:11,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-11-18 20:26:11,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:11,346 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:11,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-11-18 20:26:11,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:26:11,348 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:11,371 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:26:11,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-11-18 20:26:11,373 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:11,374 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:11,374 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:11,374 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:11,374 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:26:11,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:11,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:11,374 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-18 20:26:11,374 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:11,374 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:11,375 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-18 20:26:11,378 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-18 20:26:11,437 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-18 20:26:11,439 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-18 20:26:11,441 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-18 20:26:11,443 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-18 20:26:11,609 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:11,609 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:26:11,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:11,611 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:11,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-11-18 20:26:11,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:26:11,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:11,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:11,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:11,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:11,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:11,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:11,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:11,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:11,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-11-18 20:26:11,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:11,630 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:11,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-11-18 20:26:11,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:11,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:11,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:11,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:11,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:11,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:11,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:11,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:11,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:26:11,653 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-18 20:26:11,653 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-18 20:26:11,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:11,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:11,655 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:11,657 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:26:11,657 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:26:11,657 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:26:11,657 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-18 20:26:11,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-11-18 20:26:11,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-11-18 20:26:11,660 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:26:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:11,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:26:11,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:11,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:26:11,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-18 20:26:12,096 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-18 20:26:12,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 965 states and 1674 transitions. cyclomatic complexity: 732 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-18 20:26:12,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 965 states and 1674 transitions. cyclomatic complexity: 732. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Result 1661 states and 2641 transitions. Complement of second has 41 states. [2022-11-18 20:26:12,355 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-18 20:26:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-18 20:26:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-11-18 20:26:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 63 transitions. Stem has 30 letters. Loop has 32 letters. [2022-11-18 20:26:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 63 transitions. Stem has 62 letters. Loop has 32 letters. [2022-11-18 20:26:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 63 transitions. Stem has 30 letters. Loop has 64 letters. [2022-11-18 20:26:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:12,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1661 states and 2641 transitions. [2022-11-18 20:26:12,375 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 142 [2022-11-18 20:26:12,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1661 states to 1389 states and 2243 transitions. [2022-11-18 20:26:12,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2022-11-18 20:26:12,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2022-11-18 20:26:12,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1389 states and 2243 transitions. [2022-11-18 20:26:12,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:12,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1389 states and 2243 transitions. [2022-11-18 20:26:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states and 2243 transitions. [2022-11-18 20:26:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1287. [2022-11-18 20:26:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 800 states have (on average 1.12375) internal successors, (899), 817 states have internal predecessors, (899), 337 states have call successors, (347), 158 states have call predecessors, (347), 150 states have return successors, (887), 311 states have call predecessors, (887), 337 states have call successors, (887) [2022-11-18 20:26:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2133 transitions. [2022-11-18 20:26:12,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1287 states and 2133 transitions. [2022-11-18 20:26:12,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:26:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:26:12,448 INFO L87 Difference]: Start difference. First operand 1287 states and 2133 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 20:26:12,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:12,758 INFO L93 Difference]: Finished difference Result 1353 states and 2267 transitions. [2022-11-18 20:26:12,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1353 states and 2267 transitions. [2022-11-18 20:26:12,772 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 174 [2022-11-18 20:26:12,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1353 states to 1319 states and 2227 transitions. [2022-11-18 20:26:12,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2022-11-18 20:26:12,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2022-11-18 20:26:12,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1319 states and 2227 transitions. [2022-11-18 20:26:12,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:12,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1319 states and 2227 transitions. [2022-11-18 20:26:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states and 2227 transitions. [2022-11-18 20:26:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1244. [2022-11-18 20:26:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 769 states have (on average 1.1157347204161248) internal successors, (858), 784 states have internal predecessors, (858), 333 states have call successors, (343), 154 states have call predecessors, (343), 142 states have return successors, (877), 305 states have call predecessors, (877), 333 states have call successors, (877) [2022-11-18 20:26:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 2078 transitions. [2022-11-18 20:26:12,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1244 states and 2078 transitions. [2022-11-18 20:26:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:26:12,847 INFO L428 stractBuchiCegarLoop]: Abstraction has 1244 states and 2078 transitions. [2022-11-18 20:26:12,847 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-18 20:26:12,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1244 states and 2078 transitions. [2022-11-18 20:26:12,854 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 142 [2022-11-18 20:26:12,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:12,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:12,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:12,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-18 20:26:12,855 INFO L748 eck$LassoCheckResult]: Stem: 23656#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 23633#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; 23634#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 23655#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; 23678#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23844#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23843#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; 23623#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23624#factENTRY ~n := #in~n; 23863#L25 assume ~n <= 0;#res := 1; 23862#factFINAL assume true; 23860#factEXIT >#68#return; 23669#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23670#factENTRY ~n := #in~n; 23945#L25 assume ~n <= 0;#res := 1; 23944#factFINAL assume true; 23943#factEXIT >#70#return; 23607#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23608#factENTRY ~n := #in~n; 24054#L25 assume ~n <= 0;#res := 1; 24053#factFINAL assume true; 24050#factEXIT >#72#return; 24048#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; 24046#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24043#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24044#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24176#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; 24111#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 24115#factENTRY ~n := #in~n; 24181#L25 assume !(~n <= 0); 24122#L26 call #t~ret0 := fact(~n - 1);< 24164#factENTRY ~n := #in~n; 24174#L25 assume ~n <= 0;#res := 1; 24172#factFINAL assume true; 24120#factEXIT >#66#return; 24119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24116#factFINAL assume true; 24107#factEXIT >#74#return; 23602#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24092#factENTRY ~n := #in~n; 24098#L25 assume !(~n <= 0); 24011#L26 call #t~ret0 := fact(~n - 1);< 24035#factENTRY [2022-11-18 20:26:12,856 INFO L750 eck$LassoCheckResult]: Loop: 24035#factENTRY ~n := #in~n; 24056#L25 assume !(~n <= 0); 24016#L26 call #t~ret0 := fact(~n - 1);< 24035#factENTRY [2022-11-18 20:26:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1705579033, now seen corresponding path program 1 times [2022-11-18 20:26:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:12,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333284342] [2022-11-18 20:26:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:12,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:12,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058475547] [2022-11-18 20:26:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:12,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:12,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:12,864 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:12,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-11-18 20:26:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:12,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:26:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-18 20:26:12,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:26:12,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:12,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333284342] [2022-11-18 20:26:12,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:12,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058475547] [2022-11-18 20:26:12,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058475547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:26:12,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:26:12,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:26:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289498698] [2022-11-18 20:26:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:26:12,979 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2022-11-18 20:26:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:12,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814323241] [2022-11-18 20:26:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:12,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:12,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:13,014 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:13,015 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:13,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:13,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:13,015 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:26:13,015 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,015 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:13,015 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:13,016 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2022-11-18 20:26:13,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:13,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:13,016 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-18 20:26:13,019 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-18 20:26:13,021 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-18 20:26:13,026 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-18 20:26:13,053 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:13,053 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:26:13,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,055 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-11-18 20:26:13,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:13,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:13,083 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:13,083 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-18 20:26:13,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,089 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-11-18 20:26:13,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:13,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:13,128 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:13,128 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-18 20:26:13,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,133 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:13,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:13,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-11-18 20:26:13,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,172 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:26:13,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:13,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-11-18 20:26:13,207 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:26:13,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,211 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:13,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:13,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:13,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:13,211 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:26:13,211 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,211 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:13,211 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:13,211 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2022-11-18 20:26:13,211 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:13,211 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:13,212 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-18 20:26:13,214 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-18 20:26:13,216 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-18 20:26:13,222 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-18 20:26:13,245 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:13,245 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:26:13,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,246 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:26:13,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:13,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:13,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:13,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:13,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:13,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:13,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:13,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-11-18 20:26:13,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:13,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,288 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:13,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:13,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:13,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:13,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:13,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:13,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:13,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:13,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-11-18 20:26:13,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:13,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,332 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:13,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:13,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:13,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:13,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:13,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:13,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:13,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:13,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-11-18 20:26:13,367 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:26:13,370 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-18 20:26:13,370 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-18 20:26:13,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:13,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:13,374 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:13,375 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:26:13,375 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:26:13,375 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:26:13,375 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-18 20:26:13,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-11-18 20:26:13,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,379 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:26:13,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:13,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:26:13,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:13,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:26:13,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:13,665 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-18 20:26:13,665 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-18 20:26:13,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1244 states and 2078 transitions. cyclomatic complexity: 861 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:26:13,814 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1244 states and 2078 transitions. cyclomatic complexity: 861. 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 1316 states and 2168 transitions. Complement of second has 13 states. [2022-11-18 20:26:13,815 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-18 20:26:13,815 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:26:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-18 20:26:13,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 42 letters. Loop has 3 letters. [2022-11-18 20:26:13,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:13,816 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-18 20:26:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:13,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:13,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:26:13,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:14,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:26:14,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:14,192 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-18 20:26:14,193 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-18 20:26:14,193 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1244 states and 2078 transitions. cyclomatic complexity: 861 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:26:14,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1244 states and 2078 transitions. cyclomatic complexity: 861. 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 1316 states and 2168 transitions. Complement of second has 13 states. [2022-11-18 20:26:14,298 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-18 20:26:14,299 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:26:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-18 20:26:14,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 42 letters. Loop has 3 letters. [2022-11-18 20:26:14,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:14,299 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-18 20:26:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:14,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:26:14,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:14,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:26:14,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:14,615 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-18 20:26:14,617 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-18 20:26:14,617 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1244 states and 2078 transitions. cyclomatic complexity: 861 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:26:14,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1244 states and 2078 transitions. cyclomatic complexity: 861. 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 1488 states and 2386 transitions. Complement of second has 16 states. [2022-11-18 20:26:14,733 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-18 20:26:14,734 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, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:26:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-11-18 20:26:14,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 3 letters. [2022-11-18 20:26:14,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:14,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 45 letters. Loop has 3 letters. [2022-11-18 20:26:14,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:14,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 42 letters. Loop has 6 letters. [2022-11-18 20:26:14,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:14,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1488 states and 2386 transitions. [2022-11-18 20:26:14,752 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 136 [2022-11-18 20:26:14,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1488 states to 1318 states and 2194 transitions. [2022-11-18 20:26:14,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 347 [2022-11-18 20:26:14,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 360 [2022-11-18 20:26:14,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1318 states and 2194 transitions. [2022-11-18 20:26:14,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:14,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1318 states and 2194 transitions. [2022-11-18 20:26:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states and 2194 transitions. [2022-11-18 20:26:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1234. [2022-11-18 20:26:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 763 states have (on average 1.1192660550458715) internal successors, (854), 770 states have internal predecessors, (854), 327 states have call successors, (337), 158 states have call predecessors, (337), 144 states have return successors, (859), 305 states have call predecessors, (859), 327 states have call successors, (859) [2022-11-18 20:26:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 2050 transitions. [2022-11-18 20:26:14,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1234 states and 2050 transitions. [2022-11-18 20:26:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:14,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:26:14,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:26:14,816 INFO L87 Difference]: Start difference. First operand 1234 states and 2050 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-18 20:26:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:14,906 INFO L93 Difference]: Finished difference Result 1120 states and 1764 transitions. [2022-11-18 20:26:14,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1120 states and 1764 transitions. [2022-11-18 20:26:14,917 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 134 [2022-11-18 20:26:14,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1120 states to 1106 states and 1750 transitions. [2022-11-18 20:26:14,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331 [2022-11-18 20:26:14,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2022-11-18 20:26:14,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1106 states and 1750 transitions. [2022-11-18 20:26:14,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:14,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1106 states and 1750 transitions. [2022-11-18 20:26:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states and 1750 transitions. [2022-11-18 20:26:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 862. [2022-11-18 20:26:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 550 states have (on average 1.1109090909090908) internal successors, (611), 539 states have internal predecessors, (611), 223 states have call successors, (229), 104 states have call predecessors, (229), 89 states have return successors, (548), 218 states have call predecessors, (548), 223 states have call successors, (548) [2022-11-18 20:26:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1388 transitions. [2022-11-18 20:26:15,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 862 states and 1388 transitions. [2022-11-18 20:26:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:26:15,005 INFO L428 stractBuchiCegarLoop]: Abstraction has 862 states and 1388 transitions. [2022-11-18 20:26:15,005 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-18 20:26:15,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 862 states and 1388 transitions. [2022-11-18 20:26:15,011 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 133 [2022-11-18 20:26:15,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:15,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:15,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:15,012 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-18 20:26:15,012 INFO L748 eck$LassoCheckResult]: Stem: 31989#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 31957#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; 31958#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 31988#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; 31972#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 31973#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31990#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; 31942#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31943#factENTRY ~n := #in~n; 32198#L25 assume ~n <= 0;#res := 1; 32193#factFINAL assume true; 32191#factEXIT >#68#return; 32188#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 32189#factENTRY ~n := #in~n; 32192#L25 assume ~n <= 0;#res := 1; 32190#factFINAL assume true; 32187#factEXIT >#70#return; 31938#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31939#factENTRY ~n := #in~n; 32315#L25 assume ~n <= 0;#res := 1; 32314#factFINAL assume true; 32312#factEXIT >#72#return; 31977#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; 31978#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 31982#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 32005#L42-3 [2022-11-18 20:26:15,012 INFO L750 eck$LassoCheckResult]: Loop: 32005#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 32300#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; 31927#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31928#factENTRY ~n := #in~n; 32316#L25 assume !(~n <= 0); 31932#L26 call #t~ret0 := fact(~n - 1);< 31963#factENTRY ~n := #in~n; 32298#L25 assume !(~n <= 0); 32253#L26 call #t~ret0 := fact(~n - 1);< 32259#factENTRY ~n := #in~n; 32299#L25 assume ~n <= 0;#res := 1; 32313#factFINAL assume true; 32310#factEXIT >#66#return; 32254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32258#factFINAL assume true; 32251#factEXIT >#66#return; 32248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32242#factFINAL assume true; 32237#factEXIT >#74#return; 32002#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 32003#factENTRY ~n := #in~n; 32246#L25 assume ~n <= 0;#res := 1; 32245#factFINAL assume true; 32244#factEXIT >#76#return; 32238#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 32243#factENTRY ~n := #in~n; 32510#L25 assume !(~n <= 0); 32252#L26 call #t~ret0 := fact(~n - 1);< 32255#factENTRY ~n := #in~n; 32298#L25 assume !(~n <= 0); 32253#L26 call #t~ret0 := fact(~n - 1);< 32259#factENTRY ~n := #in~n; 32299#L25 assume ~n <= 0;#res := 1; 32313#factFINAL assume true; 32310#factEXIT >#66#return; 32254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32258#factFINAL assume true; 32251#factEXIT >#66#return; 32248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 32242#factFINAL assume true; 32237#factEXIT >#78#return; 31959#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; 31960#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 31969#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 32005#L42-3 [2022-11-18 20:26:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1076736539, now seen corresponding path program 2 times [2022-11-18 20:26:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:15,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991506574] [2022-11-18 20:26:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:15,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:15,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96881825] [2022-11-18 20:26:15,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:26:15,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:15,020 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:15,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-11-18 20:26:15,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:26:15,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:26:15,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:15,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1135234130, now seen corresponding path program 2 times [2022-11-18 20:26:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562444869] [2022-11-18 20:26:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:15,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:15,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894844747] [2022-11-18 20:26:15,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:26:15,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:15,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:15,102 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:15,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-11-18 20:26:15,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:26:15,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:26:15,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:15,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1697268846, now seen corresponding path program 1 times [2022-11-18 20:26:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:15,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233739148] [2022-11-18 20:26:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:15,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:15,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533397394] [2022-11-18 20:26:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:15,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:15,211 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:15,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-11-18 20:26:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:15,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:26:15,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 130 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 20:26:15,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-11-18 20:26:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:15,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233739148] [2022-11-18 20:26:15,523 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:15,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533397394] [2022-11-18 20:26:15,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533397394] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:15,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:15,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2022-11-18 20:26:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375761473] [2022-11-18 20:26:15,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:28,227 WARN L233 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:26:28,478 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:28,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:28,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:28,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:28,478 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:26:28,478 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,478 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:28,478 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:28,478 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2022-11-18 20:26:28,478 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:28,478 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:28,479 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-18 20:26:28,481 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-18 20:26:28,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-18 20:26:28,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-18 20:26:28,487 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-18 20:26:28,580 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-18 20:26:28,843 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:28,843 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:26:28,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:28,851 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:28,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-11-18 20:26:28,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:28,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:28,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:28,876 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-18 20:26:28,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-11-18 20:26:28,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:28,879 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:28,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-11-18 20:26:28,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:28,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:28,893 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:28,893 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-18 20:26:28,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-11-18 20:26:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:28,897 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:28,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-11-18 20:26:28,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:28,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:28,911 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:28,911 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-18 20:26:28,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-11-18 20:26:28,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:28,915 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:28,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-11-18 20:26:28,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:28,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:28,929 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:28,929 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-18 20:26:28,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:28,933 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:28,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-11-18 20:26:28,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:28,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:28,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-11-18 20:26:28,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:28,953 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:28,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-11-18 20:26:28,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:26:28,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:28,994 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:26:28,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-11-18 20:26:28,996 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:28,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:28,996 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:28,997 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:28,997 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:26:28,997 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:28,997 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:28,997 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:28,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2022-11-18 20:26:28,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:28,997 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:28,998 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-18 20:26:29,006 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-18 20:26:29,008 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-18 20:26:29,110 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-18 20:26:29,114 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-18 20:26:29,116 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-18 20:26:29,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:29,383 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:26:29,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:29,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:29,388 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:29,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:29,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:29,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:29,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:29,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:29,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:29,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:29,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:29,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-11-18 20:26:29,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:29,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:29,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:29,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:29,424 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:29,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:29,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:29,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:29,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:29,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:29,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:29,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:29,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:29,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-11-18 20:26:29,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:29,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:29,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:29,472 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:29,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-11-18 20:26:29,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:29,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:29,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:29,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:29,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:29,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:29,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:29,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:29,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:26:29,542 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-18 20:26:29,542 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-18 20:26:29,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:29,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:29,546 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:29,547 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:26:29,547 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:26:29,547 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:26:29,547 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 5*ULTIMATE.start_main_~x~0#1 - 4*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-11-18 20:26:29,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-11-18 20:26:29,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:29,551 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:26:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:29,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:26:29,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:29,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:26:29,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-18 20:26:30,009 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-18 20:26:30,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 862 states and 1388 transitions. cyclomatic complexity: 547 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-18 20:26:30,288 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 862 states and 1388 transitions. cyclomatic complexity: 547. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Result 1412 states and 2028 transitions. Complement of second has 36 states. [2022-11-18 20:26:30,290 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-18 20:26:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-18 20:26:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-11-18 20:26:30,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 25 letters. Loop has 44 letters. [2022-11-18 20:26:30,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:30,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 69 letters. Loop has 44 letters. [2022-11-18 20:26:30,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:30,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 25 letters. Loop has 88 letters. [2022-11-18 20:26:30,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:30,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1412 states and 2028 transitions. [2022-11-18 20:26:30,311 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 125 [2022-11-18 20:26:30,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1412 states to 860 states and 1386 transitions. [2022-11-18 20:26:30,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2022-11-18 20:26:30,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2022-11-18 20:26:30,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 860 states and 1386 transitions. [2022-11-18 20:26:30,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:30,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 860 states and 1386 transitions. [2022-11-18 20:26:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states and 1386 transitions. [2022-11-18 20:26:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 817. [2022-11-18 20:26:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 525 states have (on average 1.1123809523809525) internal successors, (584), 513 states have internal predecessors, (584), 209 states have call successors, (215), 91 states have call predecessors, (215), 83 states have return successors, (530), 212 states have call predecessors, (530), 209 states have call successors, (530) [2022-11-18 20:26:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1329 transitions. [2022-11-18 20:26:30,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 817 states and 1329 transitions. [2022-11-18 20:26:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:30,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:26:30,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:26:30,351 INFO L87 Difference]: Start difference. First operand 817 states and 1329 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-18 20:26:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:30,643 INFO L93 Difference]: Finished difference Result 1152 states and 1982 transitions. [2022-11-18 20:26:30,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1152 states and 1982 transitions. [2022-11-18 20:26:30,653 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2022-11-18 20:26:30,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1152 states to 1149 states and 1978 transitions. [2022-11-18 20:26:30,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2022-11-18 20:26:30,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2022-11-18 20:26:30,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1978 transitions. [2022-11-18 20:26:30,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:30,668 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1149 states and 1978 transitions. [2022-11-18 20:26:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1978 transitions. [2022-11-18 20:26:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 860. [2022-11-18 20:26:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 560 states have (on average 1.1178571428571429) internal successors, (626), 547 states have internal predecessors, (626), 217 states have call successors, (223), 91 states have call predecessors, (223), 83 states have return successors, (551), 221 states have call predecessors, (551), 217 states have call successors, (551) [2022-11-18 20:26:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1400 transitions. [2022-11-18 20:26:30,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 860 states and 1400 transitions. [2022-11-18 20:26:30,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:26:30,705 INFO L428 stractBuchiCegarLoop]: Abstraction has 860 states and 1400 transitions. [2022-11-18 20:26:30,705 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-18 20:26:30,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 860 states and 1400 transitions. [2022-11-18 20:26:30,709 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 125 [2022-11-18 20:26:30,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:30,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:30,711 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-18 20:26:30,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 13, 13, 13, 13, 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-18 20:26:30,712 INFO L748 eck$LassoCheckResult]: Stem: 36935#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 36907#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; 36908#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 36934#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; 36922#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 36923#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37388#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; 36892#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36893#factENTRY ~n := #in~n; 37351#L25 assume ~n <= 0;#res := 1; 37350#factFINAL assume true; 37348#factEXIT >#68#return; 37345#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37346#factENTRY ~n := #in~n; 37349#L25 assume ~n <= 0;#res := 1; 37347#factFINAL assume true; 37344#factEXIT >#70#return; 36888#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36889#factENTRY ~n := #in~n; 37561#L25 assume ~n <= 0;#res := 1; 37560#factFINAL assume true; 37559#factEXIT >#72#return; 37557#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; 37558#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37640#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37641#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37470#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; 37452#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37457#factENTRY ~n := #in~n; 37454#L25 assume ~n <= 0;#res := 1; 37451#factFINAL assume true; 37453#factEXIT >#74#return; 37416#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37421#factENTRY ~n := #in~n; 37418#L25 assume ~n <= 0;#res := 1; 37415#factFINAL assume true; 37417#factEXIT >#76#return; 37399#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37401#factENTRY ~n := #in~n; 37408#L25 assume !(~n <= 0); 37405#L26 call #t~ret0 := fact(~n - 1);< 37406#factENTRY ~n := #in~n; 37410#L25 assume !(~n <= 0); 37497#L26 call #t~ret0 := fact(~n - 1);< 37519#factENTRY ~n := #in~n; 37520#L25 assume ~n <= 0;#res := 1; 37527#factFINAL assume true; 37526#factEXIT >#66#return; 37498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37518#factFINAL assume true; 37496#factEXIT >#66#return; 37490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37485#factFINAL assume true; 37480#factEXIT >#78#return; 37445#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; 37444#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37443#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37150#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 37148#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37116#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37114#L42-3 [2022-11-18 20:26:30,712 INFO L750 eck$LassoCheckResult]: Loop: 37114#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37113#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; 36999#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37031#factENTRY ~n := #in~n; 37077#L25 assume !(~n <= 0); 37044#L26 call #t~ret0 := fact(~n - 1);< 37073#factENTRY ~n := #in~n; 37079#L25 assume !(~n <= 0); 37065#L26 call #t~ret0 := fact(~n - 1);< 37075#factENTRY ~n := #in~n; 37079#L25 assume !(~n <= 0); 37065#L26 call #t~ret0 := fact(~n - 1);< 37075#factENTRY ~n := #in~n; 37083#L25 assume ~n <= 0;#res := 1; 37096#factFINAL assume true; 37095#factEXIT >#66#return; 37093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37092#factFINAL assume true; 37064#factEXIT >#66#return; 37068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37074#factFINAL assume true; 37072#factEXIT >#66#return; 37063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37061#factFINAL assume true; 36985#factEXIT >#68#return; 36876#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36967#factENTRY ~n := #in~n; 36964#L25 assume ~n <= 0;#res := 1; 36965#factFINAL assume true; 36875#factEXIT >#70#return; 36879#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37014#factENTRY ~n := #in~n; 37094#L25 assume !(~n <= 0); 37066#L26 call #t~ret0 := fact(~n - 1);< 37070#factENTRY ~n := #in~n; 37079#L25 assume !(~n <= 0); 37065#L26 call #t~ret0 := fact(~n - 1);< 37075#factENTRY ~n := #in~n; 37083#L25 assume ~n <= 0;#res := 1; 37096#factFINAL assume true; 37095#factEXIT >#66#return; 37093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37092#factFINAL assume true; 37064#factEXIT >#66#return; 37062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37057#factFINAL assume true; 37058#factEXIT >#72#return; 37009#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; 37149#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 36971#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 36962#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36936#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; 36937#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37033#factENTRY ~n := #in~n; 37076#L25 assume !(~n <= 0); 36915#L26 call #t~ret0 := fact(~n - 1);< 37071#factENTRY ~n := #in~n; 37048#L25 assume ~n <= 0;#res := 1; 37047#factFINAL assume true; 37040#factEXIT >#66#return; 37039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37036#factFINAL assume true; 37034#factEXIT >#68#return; 36990#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37031#factENTRY ~n := #in~n; 37077#L25 assume !(~n <= 0); 37044#L26 call #t~ret0 := fact(~n - 1);< 37073#factENTRY ~n := #in~n; 37079#L25 assume !(~n <= 0); 37065#L26 call #t~ret0 := fact(~n - 1);< 37075#factENTRY ~n := #in~n; 37083#L25 assume ~n <= 0;#res := 1; 37096#factFINAL assume true; 37095#factEXIT >#66#return; 37093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37092#factFINAL assume true; 37064#factEXIT >#66#return; 37062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37057#factFINAL assume true; 37058#factEXIT >#70#return; 37010#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37038#factENTRY ~n := #in~n; 37059#L25 assume ~n <= 0;#res := 1; 37032#factFINAL assume true; 37025#factEXIT >#72#return; 37029#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; 37152#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37051#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37052#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36978#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; 36993#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37031#factENTRY ~n := #in~n; 37077#L25 assume !(~n <= 0); 37044#L26 call #t~ret0 := fact(~n - 1);< 37073#factENTRY ~n := #in~n; 37079#L25 assume !(~n <= 0); 37065#L26 call #t~ret0 := fact(~n - 1);< 37075#factENTRY ~n := #in~n; 37083#L25 assume ~n <= 0;#res := 1; 37096#factFINAL assume true; 37095#factEXIT >#66#return; 37093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37092#factFINAL assume true; 37064#factEXIT >#66#return; 37062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37057#factFINAL assume true; 37058#factEXIT >#74#return; 37000#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37031#factENTRY ~n := #in~n; 37077#L25 assume !(~n <= 0); 37044#L26 call #t~ret0 := fact(~n - 1);< 37073#factENTRY ~n := #in~n; 37079#L25 assume !(~n <= 0); 37065#L26 call #t~ret0 := fact(~n - 1);< 37075#factENTRY ~n := #in~n; 37083#L25 assume ~n <= 0;#res := 1; 37096#factFINAL assume true; 37095#factEXIT >#66#return; 37093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37092#factFINAL assume true; 37064#factEXIT >#66#return; 37062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37057#factFINAL assume true; 37058#factEXIT >#76#return; 37013#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37024#factENTRY ~n := #in~n; 37060#L25 assume !(~n <= 0); 37043#L26 call #t~ret0 := fact(~n - 1);< 37046#factENTRY ~n := #in~n; 37048#L25 assume ~n <= 0;#res := 1; 37047#factFINAL assume true; 37040#factEXIT >#66#return; 37039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37036#factFINAL assume true; 37034#factEXIT >#78#return; 37007#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; 36981#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 36982#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 36977#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 36931#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 36932#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37114#L42-3 [2022-11-18 20:26:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2081856815, now seen corresponding path program 1 times [2022-11-18 20:26:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:30,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815012670] [2022-11-18 20:26:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:30,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:30,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36236589] [2022-11-18 20:26:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:30,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:30,726 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:30,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2022-11-18 20:26:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:30,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:26:30,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-18 20:26:30,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:26:30,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:30,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815012670] [2022-11-18 20:26:30,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:30,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36236589] [2022-11-18 20:26:30,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36236589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:26:30,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:26:30,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:26:30,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937695348] [2022-11-18 20:26:30,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:26:30,849 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash 771536619, now seen corresponding path program 7 times [2022-11-18 20:26:30,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:30,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820175034] [2022-11-18 20:26:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:30,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:30,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:30,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350269912] [2022-11-18 20:26:30,890 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:26:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:30,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:30,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:30,892 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:30,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2022-11-18 20:26:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:30,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:26:30,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 563 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2022-11-18 20:26:31,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 35 proven. 448 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2022-11-18 20:26:31,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:31,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820175034] [2022-11-18 20:26:31,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:31,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350269912] [2022-11-18 20:26:31,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350269912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:31,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:31,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2022-11-18 20:26:31,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151399609] [2022-11-18 20:26:31,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:31,787 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:31,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:26:31,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:26:31,788 INFO L87 Difference]: Start difference. First operand 860 states and 1400 transitions. cyclomatic complexity: 560 Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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-18 20:26:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:31,935 INFO L93 Difference]: Finished difference Result 834 states and 1281 transitions. [2022-11-18 20:26:31,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 834 states and 1281 transitions. [2022-11-18 20:26:31,942 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 124 [2022-11-18 20:26:31,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 834 states to 730 states and 1163 transitions. [2022-11-18 20:26:31,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2022-11-18 20:26:31,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2022-11-18 20:26:31,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 730 states and 1163 transitions. [2022-11-18 20:26:31,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:31,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 730 states and 1163 transitions. [2022-11-18 20:26:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states and 1163 transitions. [2022-11-18 20:26:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 683. [2022-11-18 20:26:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 453 states have (on average 1.119205298013245) internal successors, (507), 431 states have internal predecessors, (507), 170 states have call successors, (172), 72 states have call predecessors, (172), 60 states have return successors, (401), 179 states have call predecessors, (401), 170 states have call successors, (401) [2022-11-18 20:26:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1080 transitions. [2022-11-18 20:26:31,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 683 states and 1080 transitions. [2022-11-18 20:26:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:26:31,973 INFO L428 stractBuchiCegarLoop]: Abstraction has 683 states and 1080 transitions. [2022-11-18 20:26:31,973 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-18 20:26:31,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 683 states and 1080 transitions. [2022-11-18 20:26:31,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2022-11-18 20:26:31,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:31,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:31,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 6, 3, 3, 3, 3, 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-18 20:26:31,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 15, 15, 15, 15, 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-18 20:26:31,978 INFO L748 eck$LassoCheckResult]: Stem: 39679#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 39646#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; 39647#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 39678#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; 39664#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39665#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40241#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; 39637#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39638#factENTRY ~n := #in~n; 40234#L25 assume ~n <= 0;#res := 1; 40232#factFINAL assume true; 40231#factEXIT >#68#return; 40229#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40230#factENTRY ~n := #in~n; 40235#L25 assume ~n <= 0;#res := 1; 40233#factFINAL assume true; 40228#factEXIT >#70#return; 39631#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39632#factENTRY ~n := #in~n; 40259#L25 assume ~n <= 0;#res := 1; 40258#factFINAL assume true; 40253#factEXIT >#72#return; 40251#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; 40249#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 40248#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40190#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40010#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; 39984#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39985#factENTRY ~n := #in~n; 40021#L25 assume !(~n <= 0); 39657#L26 call #t~ret0 := fact(~n - 1);< 40017#factENTRY ~n := #in~n; 40022#L25 assume ~n <= 0;#res := 1; 40019#factFINAL assume true; 40015#factEXIT >#66#return; 40013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40009#factFINAL assume true; 39983#factEXIT >#74#return; 39972#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39974#factENTRY ~n := #in~n; 39990#L25 assume ~n <= 0;#res := 1; 39978#factFINAL assume true; 39971#factEXIT >#76#return; 39930#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39992#factENTRY ~n := #in~n; 39998#L25 assume !(~n <= 0); 39995#L26 call #t~ret0 := fact(~n - 1);< 39996#factENTRY ~n := #in~n; 40018#L25 assume !(~n <= 0); 40114#L26 call #t~ret0 := fact(~n - 1);< 40127#factENTRY ~n := #in~n; 40132#L25 assume ~n <= 0;#res := 1; 40139#factFINAL assume true; 40136#factEXIT >#66#return; 40115#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40126#factFINAL assume true; 40113#factEXIT >#66#return; 40107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40102#factFINAL assume true; 40097#factEXIT >#78#return; 40095#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; 40091#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 40088#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39726#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 39727#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 40200#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39786#L42-3 [2022-11-18 20:26:31,978 INFO L750 eck$LassoCheckResult]: Loop: 39786#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39783#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; 39730#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39766#factENTRY ~n := #in~n; 39851#L25 assume !(~n <= 0); 39778#L26 call #t~ret0 := fact(~n - 1);< 39805#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39824#L25 assume ~n <= 0;#res := 1; 39827#factFINAL assume true; 39822#factEXIT >#66#return; 39819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39806#factFINAL assume true; 39798#factEXIT >#66#return; 39802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39842#factFINAL assume true; 39841#factEXIT >#66#return; 39840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39839#factFINAL assume true; 39729#factEXIT >#68#return; 39752#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39792#factENTRY ~n := #in~n; 39794#L25 assume ~n <= 0;#res := 1; 39793#factFINAL assume true; 39790#factEXIT >#70#return; 39736#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39712#factENTRY ~n := #in~n; 39814#L25 assume !(~n <= 0); 39800#L26 call #t~ret0 := fact(~n - 1);< 39804#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39824#L25 assume ~n <= 0;#res := 1; 39827#factFINAL assume true; 39822#factEXIT >#66#return; 39819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39806#factFINAL assume true; 39798#factEXIT >#66#return; 39797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39796#factFINAL assume true; 39795#factEXIT >#72#return; 39753#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; 39876#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 39875#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39874#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39873#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; 39763#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39771#factENTRY ~n := #in~n; 39825#L25 assume !(~n <= 0); 39654#L26 call #t~ret0 := fact(~n - 1);< 39823#factENTRY ~n := #in~n; 39782#L25 assume ~n <= 0;#res := 1; 39781#factFINAL assume true; 39775#factEXIT >#66#return; 39774#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39770#factFINAL assume true; 39768#factEXIT >#68#return; 39747#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39766#factENTRY ~n := #in~n; 39851#L25 assume !(~n <= 0); 39778#L26 call #t~ret0 := fact(~n - 1);< 39805#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39824#L25 assume ~n <= 0;#res := 1; 39827#factFINAL assume true; 39822#factEXIT >#66#return; 39819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39806#factFINAL assume true; 39798#factEXIT >#66#return; 39802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39842#factFINAL assume true; 39841#factEXIT >#66#return; 39840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39839#factFINAL assume true; 39729#factEXIT >#70#return; 39759#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39773#factENTRY ~n := #in~n; 39811#L25 assume ~n <= 0;#res := 1; 39767#factFINAL assume true; 39761#factEXIT >#72#return; 39764#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; 39923#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 39661#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39917#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39915#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; 39732#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39766#factENTRY ~n := #in~n; 39851#L25 assume !(~n <= 0); 39778#L26 call #t~ret0 := fact(~n - 1);< 39805#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39824#L25 assume ~n <= 0;#res := 1; 39827#factFINAL assume true; 39822#factEXIT >#66#return; 39819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39806#factFINAL assume true; 39798#factEXIT >#66#return; 39797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39796#factFINAL assume true; 39795#factEXIT >#74#return; 39737#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39766#factENTRY ~n := #in~n; 39851#L25 assume !(~n <= 0); 39778#L26 call #t~ret0 := fact(~n - 1);< 39805#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39809#L25 assume !(~n <= 0); 39799#L26 call #t~ret0 := fact(~n - 1);< 39807#factENTRY ~n := #in~n; 39824#L25 assume ~n <= 0;#res := 1; 39827#factFINAL assume true; 39822#factEXIT >#66#return; 39819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39806#factFINAL assume true; 39798#factEXIT >#66#return; 39802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39842#factFINAL assume true; 39841#factEXIT >#66#return; 39840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39839#factFINAL assume true; 39729#factEXIT >#76#return; 39755#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39725#factENTRY ~n := #in~n; 39812#L25 assume !(~n <= 0); 39777#L26 call #t~ret0 := fact(~n - 1);< 39780#factENTRY ~n := #in~n; 39782#L25 assume ~n <= 0;#res := 1; 39781#factFINAL assume true; 39775#factEXIT >#66#return; 39774#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39770#factFINAL assume true; 39768#factEXIT >#78#return; 39758#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; 39922#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 39920#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39918#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 39668#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 39669#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39786#L42-3 [2022-11-18 20:26:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 33442521, now seen corresponding path program 2 times [2022-11-18 20:26:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:31,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478336397] [2022-11-18 20:26:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:31,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [877161146] [2022-11-18 20:26:31,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:26:31,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:31,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:31,991 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:32,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2022-11-18 20:26:32,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:26:32,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:32,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:26:32,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-18 20:26:32,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-11-18 20:26:32,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:32,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478336397] [2022-11-18 20:26:32,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:32,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877161146] [2022-11-18 20:26:32,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877161146] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:32,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:32,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-11-18 20:26:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821675884] [2022-11-18 20:26:32,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:32,400 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2024550885, now seen corresponding path program 8 times [2022-11-18 20:26:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908139475] [2022-11-18 20:26:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:32,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:32,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300889062] [2022-11-18 20:26:32,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:26:32,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:32,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:32,415 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:32,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2022-11-18 20:26:32,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:26:32,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:32,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:26:32,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 647 proven. 64 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2022-11-18 20:26:32,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 35 proven. 510 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-11-18 20:26:33,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:33,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908139475] [2022-11-18 20:26:33,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:33,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300889062] [2022-11-18 20:26:33,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300889062] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:33,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:33,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2022-11-18 20:26:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855244148] [2022-11-18 20:26:33,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:33,369 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:33,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:26:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:26:33,370 INFO L87 Difference]: Start difference. First operand 683 states and 1080 transitions. cyclomatic complexity: 411 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-18 20:26:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:33,881 INFO L93 Difference]: Finished difference Result 1013 states and 1694 transitions. [2022-11-18 20:26:33,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1013 states and 1694 transitions. [2022-11-18 20:26:33,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 200 [2022-11-18 20:26:33,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1013 states to 1007 states and 1678 transitions. [2022-11-18 20:26:33,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-11-18 20:26:33,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-11-18 20:26:33,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1007 states and 1678 transitions. [2022-11-18 20:26:33,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:33,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1007 states and 1678 transitions. [2022-11-18 20:26:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states and 1678 transitions. [2022-11-18 20:26:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 745. [2022-11-18 20:26:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 474 states have (on average 1.1265822784810127) internal successors, (534), 459 states have internal predecessors, (534), 208 states have call successors, (212), 72 states have call predecessors, (212), 63 states have return successors, (491), 213 states have call predecessors, (491), 208 states have call successors, (491) [2022-11-18 20:26:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1237 transitions. [2022-11-18 20:26:33,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 745 states and 1237 transitions. [2022-11-18 20:26:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:26:33,938 INFO L428 stractBuchiCegarLoop]: Abstraction has 745 states and 1237 transitions. [2022-11-18 20:26:33,938 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-11-18 20:26:33,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 1237 transitions. [2022-11-18 20:26:33,942 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 125 [2022-11-18 20:26:33,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:33,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:33,944 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 7, 3, 3, 3, 3, 3, 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] [2022-11-18 20:26:33,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [25, 25, 16, 16, 16, 16, 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-18 20:26:33,944 INFO L748 eck$LassoCheckResult]: Stem: 42733#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42703#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; 42704#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 42732#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; 42718#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42719#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43106#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; 42691#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42692#factENTRY ~n := #in~n; 43165#L25 assume ~n <= 0;#res := 1; 43164#factFINAL assume true; 43162#factEXIT >#68#return; 43159#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43160#factENTRY ~n := #in~n; 43163#L25 assume ~n <= 0;#res := 1; 43161#factFINAL assume true; 43158#factEXIT >#70#return; 42687#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42688#factENTRY ~n := #in~n; 43224#L25 assume ~n <= 0;#res := 1; 43223#factFINAL assume true; 43222#factEXIT >#72#return; 42724#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; 42725#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 42727#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43290#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43287#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; 43272#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43274#factENTRY ~n := #in~n; 43307#L25 assume !(~n <= 0); 42713#L26 call #t~ret0 := fact(~n - 1);< 43293#factENTRY ~n := #in~n; 43310#L25 assume ~n <= 0;#res := 1; 43303#factFINAL assume true; 43291#factEXIT >#66#return; 43288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43284#factFINAL assume true; 43271#factEXIT >#74#return; 43243#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43246#factENTRY ~n := #in~n; 43248#L25 assume ~n <= 0;#res := 1; 43247#factFINAL assume true; 43242#factEXIT >#76#return; 43229#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43231#factENTRY ~n := #in~n; 43237#L25 assume !(~n <= 0); 43235#L26 call #t~ret0 := fact(~n - 1);< 43236#factENTRY ~n := #in~n; 43239#L25 assume ~n <= 0;#res := 1; 43238#factFINAL assume true; 43234#factEXIT >#66#return; 43233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43232#factFINAL assume true; 43227#factEXIT >#78#return; 43230#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; 43258#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; 42902#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 42895#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42892#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42855#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42854#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; 42802#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42820#factENTRY ~n := #in~n; 42869#L25 assume !(~n <= 0); 42710#L26 call #t~ret0 := fact(~n - 1);< 42867#factENTRY ~n := #in~n; 42883#L25 assume ~n <= 0;#res := 1; 42832#factFINAL assume true; 42825#factEXIT >#66#return; 42823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42824#factFINAL assume true; 42862#factEXIT >#68#return; 42675#L30-1 [2022-11-18 20:26:33,946 INFO L750 eck$LassoCheckResult]: Loop: 42675#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42767#factENTRY ~n := #in~n; 42925#L25 assume ~n <= 0;#res := 1; 42693#factFINAL assume true; 42673#factEXIT >#70#return; 42678#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42844#factENTRY ~n := #in~n; 42842#L25 assume !(~n <= 0); 42827#L26 call #t~ret0 := fact(~n - 1);< 42870#factENTRY ~n := #in~n; 42838#L25 assume !(~n <= 0); 42834#L26 call #t~ret0 := fact(~n - 1);< 42837#factENTRY ~n := #in~n; 42838#L25 assume !(~n <= 0); 42834#L26 call #t~ret0 := fact(~n - 1);< 42837#factENTRY ~n := #in~n; 42839#L25 assume ~n <= 0;#res := 1; 42881#factFINAL assume true; 42872#factEXIT >#66#return; 42871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42868#factFINAL assume true; 42866#factEXIT >#66#return; 42861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42864#factFINAL assume true; 42859#factEXIT >#66#return; 42858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42857#factFINAL assume true; 42856#factEXIT >#72#return; 42814#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; 42952#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 42772#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42759#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42734#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; 42735#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42820#factENTRY ~n := #in~n; 42869#L25 assume !(~n <= 0); 42710#L26 call #t~ret0 := fact(~n - 1);< 42867#factENTRY ~n := #in~n; 42882#L25 assume !(~n <= 0); 42709#L26 call #t~ret0 := fact(~n - 1);< 42712#factENTRY ~n := #in~n; 42839#L25 assume ~n <= 0;#res := 1; 42881#factFINAL assume true; 42872#factEXIT >#66#return; 42871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42868#factFINAL assume true; 42866#factEXIT >#66#return; 42865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42819#factFINAL assume true; 42781#factEXIT >#68#return; 42784#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42821#factENTRY ~n := #in~n; 42852#L25 assume !(~n <= 0); 42827#L26 call #t~ret0 := fact(~n - 1);< 42870#factENTRY ~n := #in~n; 42838#L25 assume !(~n <= 0); 42834#L26 call #t~ret0 := fact(~n - 1);< 42837#factENTRY ~n := #in~n; 42838#L25 assume !(~n <= 0); 42834#L26 call #t~ret0 := fact(~n - 1);< 42837#factENTRY ~n := #in~n; 42839#L25 assume ~n <= 0;#res := 1; 42881#factFINAL assume true; 42872#factEXIT >#66#return; 42871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42868#factFINAL assume true; 42866#factEXIT >#66#return; 42861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42864#factFINAL assume true; 42859#factEXIT >#66#return; 42858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42857#factFINAL assume true; 42856#factEXIT >#70#return; 42813#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42822#factENTRY ~n := #in~n; 42926#L25 assume !(~n <= 0); 42765#L26 call #t~ret0 := fact(~n - 1);< 42830#factENTRY ~n := #in~n; 42883#L25 assume ~n <= 0;#res := 1; 42832#factFINAL assume true; 42825#factEXIT >#66#return; 42823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42824#factFINAL assume true; 42862#factEXIT >#72#return; 42848#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; 42945#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 42905#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42903#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42894#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; 42793#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42821#factENTRY ~n := #in~n; 42852#L25 assume !(~n <= 0); 42827#L26 call #t~ret0 := fact(~n - 1);< 42870#factENTRY ~n := #in~n; 42838#L25 assume !(~n <= 0); 42834#L26 call #t~ret0 := fact(~n - 1);< 42837#factENTRY ~n := #in~n; 42839#L25 assume ~n <= 0;#res := 1; 42881#factFINAL assume true; 42872#factEXIT >#66#return; 42871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42868#factFINAL assume true; 42866#factEXIT >#66#return; 42865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42819#factFINAL assume true; 42781#factEXIT >#74#return; 42812#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42821#factENTRY ~n := #in~n; 42852#L25 assume !(~n <= 0); 42827#L26 call #t~ret0 := fact(~n - 1);< 42870#factENTRY ~n := #in~n; 42838#L25 assume !(~n <= 0); 42834#L26 call #t~ret0 := fact(~n - 1);< 42837#factENTRY ~n := #in~n; 42838#L25 assume !(~n <= 0); 42834#L26 call #t~ret0 := fact(~n - 1);< 42837#factENTRY ~n := #in~n; 42839#L25 assume ~n <= 0;#res := 1; 42881#factFINAL assume true; 42872#factEXIT >#66#return; 42871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42868#factFINAL assume true; 42866#factEXIT >#66#return; 42861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42864#factFINAL assume true; 42859#factEXIT >#66#return; 42858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42857#factFINAL assume true; 42856#factEXIT >#76#return; 42764#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42818#factENTRY ~n := #in~n; 42762#L25 assume !(~n <= 0); 42765#L26 call #t~ret0 := fact(~n - 1);< 42830#factENTRY ~n := #in~n; 42883#L25 assume ~n <= 0;#res := 1; 42832#factFINAL assume true; 42825#factEXIT >#66#return; 42823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42824#factFINAL assume true; 42862#factEXIT >#78#return; 42780#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; 42779#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42778#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42776#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 42728#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42729#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42953#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42853#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; 42811#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42821#factENTRY ~n := #in~n; 42852#L25 assume !(~n <= 0); 42827#L26 call #t~ret0 := fact(~n - 1);< 42870#factENTRY ~n := #in~n; 42883#L25 assume ~n <= 0;#res := 1; 42832#factFINAL assume true; 42825#factEXIT >#66#return; 42823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42824#factFINAL assume true; 42862#factEXIT >#68#return; 42675#L30-1 [2022-11-18 20:26:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1617221305, now seen corresponding path program 3 times [2022-11-18 20:26:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:33,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495402294] [2022-11-18 20:26:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:33,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:33,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085255975] [2022-11-18 20:26:33,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:26:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:33,971 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:33,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2022-11-18 20:26:34,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-18 20:26:34,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:26:34,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:34,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1041728683, now seen corresponding path program 9 times [2022-11-18 20:26:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:34,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902850812] [2022-11-18 20:26:34,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:34,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:34,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:34,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438354104] [2022-11-18 20:26:34,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:26:34,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:34,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:34,133 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:34,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2022-11-18 20:26:34,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:26:34,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:34,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 20:26:34,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 215 proven. 152 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2022-11-18 20:26:34,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 215 proven. 154 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2022-11-18 20:26:34,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:34,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902850812] [2022-11-18 20:26:34,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:34,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438354104] [2022-11-18 20:26:34,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438354104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:34,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:34,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 18 [2022-11-18 20:26:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171160433] [2022-11-18 20:26:34,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:34,829 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:26:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:26:34,830 INFO L87 Difference]: Start difference. First operand 745 states and 1237 transitions. cyclomatic complexity: 506 Second operand has 19 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 18 states have internal predecessors, (55), 12 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (22), 7 states have call predecessors, (22), 12 states have call successors, (22) [2022-11-18 20:26:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:35,744 INFO L93 Difference]: Finished difference Result 1062 states and 1863 transitions. [2022-11-18 20:26:35,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1062 states and 1863 transitions. [2022-11-18 20:26:35,754 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 250 [2022-11-18 20:26:35,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1062 states to 842 states and 1408 transitions. [2022-11-18 20:26:35,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2022-11-18 20:26:35,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2022-11-18 20:26:35,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 842 states and 1408 transitions. [2022-11-18 20:26:35,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:35,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 842 states and 1408 transitions. [2022-11-18 20:26:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states and 1408 transitions. [2022-11-18 20:26:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 706. [2022-11-18 20:26:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 443 states have (on average 1.1264108352144468) internal successors, (499), 434 states have internal predecessors, (499), 204 states have call successors, (208), 70 states have call predecessors, (208), 59 states have return successors, (448), 201 states have call predecessors, (448), 204 states have call successors, (448) [2022-11-18 20:26:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1155 transitions. [2022-11-18 20:26:35,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 1155 transitions. [2022-11-18 20:26:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:26:35,796 INFO L428 stractBuchiCegarLoop]: Abstraction has 706 states and 1155 transitions. [2022-11-18 20:26:35,796 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-11-18 20:26:35,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 1155 transitions. [2022-11-18 20:26:35,800 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 178 [2022-11-18 20:26:35,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:35,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:35,801 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-18 20:26:35,801 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-18 20:26:35,801 INFO L748 eck$LassoCheckResult]: Stem: 45573#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 45539#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; 45540#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 45572#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; 45595#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 45678#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45676#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; 45672#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 45673#factENTRY ~n := #in~n; 45677#L25 assume ~n <= 0;#res := 1; 45675#factFINAL assume true; 45671#factEXIT >#68#return; 45668#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45669#factENTRY ~n := #in~n; 45674#L25 assume ~n <= 0;#res := 1; 45670#factFINAL assume true; 45667#factEXIT >#70#return; 45486#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 45487#factENTRY ~n := #in~n; 45775#L25 assume ~n <= 0;#res := 1; 45772#factFINAL assume true; 45771#factEXIT >#72#return; 45769#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; 45568#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 45569#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 46025#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 45576#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; 45577#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 45876#factENTRY ~n := #in~n; 45887#L25 assume !(~n <= 0); 45552#L26 call #t~ret0 := fact(~n - 1);< 45920#factENTRY ~n := #in~n; 45924#L25 assume ~n <= 0;#res := 1; 45919#factFINAL assume true; 45883#factEXIT >#66#return; 45881#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45882#factFINAL assume true; 45874#factEXIT >#74#return; 45854#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45857#factENTRY ~n := #in~n; 45861#L25 assume ~n <= 0;#res := 1; 45862#factFINAL assume true; 45853#factEXIT >#76#return; 45840#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 45928#factENTRY ~n := #in~n; 45921#L25 assume !(~n <= 0); 45903#L26 call #t~ret0 := fact(~n - 1);< 45912#factENTRY ~n := #in~n; 46015#L25 assume ~n <= 0;#res := 1; 46016#factFINAL assume true; 45902#factEXIT >#66#return; 45863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45850#factFINAL assume true; 45839#factEXIT >#78#return; 45543#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; 45544#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 45773#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 45599#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 45571#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 45560#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 45561#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46115#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; 45843#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46051#factENTRY ~n := #in~n; 46030#L25 assume !(~n <= 0); 45548#L26 call #t~ret0 := fact(~n - 1);< 46044#factENTRY ~n := #in~n; 46132#L25 assume ~n <= 0;#res := 1; 45914#factFINAL assume true; 45915#factEXIT >#66#return; 45851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45852#factFINAL assume true; 46085#factEXIT >#68#return; 46086#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 46110#factENTRY ~n := #in~n; 46112#L25 assume ~n <= 0;#res := 1; 46111#factFINAL assume true; 46108#factEXIT >#70#return; 45818#L30-2 [2022-11-18 20:26:35,802 INFO L750 eck$LassoCheckResult]: Loop: 45818#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 46059#factENTRY ~n := #in~n; 46052#L25 assume !(~n <= 0); 45869#L26 call #t~ret0 := fact(~n - 1);< 46045#factENTRY ~n := #in~n; 45923#L25 assume !(~n <= 0); 45868#L26 call #t~ret0 := fact(~n - 1);< 45918#factENTRY ~n := #in~n; 45998#L25 assume ~n <= 0;#res := 1; 46054#factFINAL assume true; 46050#factEXIT >#66#return; 46048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 46047#factFINAL assume true; 46040#factEXIT >#66#return; 46042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45842#factFINAL assume true; 45848#factEXIT >#72#return; 45835#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; 46102#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 46099#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 46097#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 46092#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; 45847#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 46051#factENTRY ~n := #in~n; 46030#L25 assume !(~n <= 0); 45548#L26 call #t~ret0 := fact(~n - 1);< 46044#factENTRY ~n := #in~n; 46132#L25 assume ~n <= 0;#res := 1; 45914#factFINAL assume true; 45915#factEXIT >#66#return; 45851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 45852#factFINAL assume true; 46085#factEXIT >#68#return; 45817#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 45849#factENTRY ~n := #in~n; 46057#L25 assume ~n <= 0;#res := 1; 46031#factFINAL assume true; 46109#factEXIT >#70#return; 45818#L30-2 [2022-11-18 20:26:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:35,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1558900032, now seen corresponding path program 4 times [2022-11-18 20:26:35,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:35,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694483379] [2022-11-18 20:26:35,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:35,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:35,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:35,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716097915] [2022-11-18 20:26:35,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:26:35,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:35,815 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:35,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2022-11-18 20:26:35,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:26:35,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:26:35,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:35,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -893475734, now seen corresponding path program 1 times [2022-11-18 20:26:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:35,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167316083] [2022-11-18 20:26:35,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:35,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:35,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59729956] [2022-11-18 20:26:35,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:35,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:35,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:35,956 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:35,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2022-11-18 20:26:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:36,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:36,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:36,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2075350423, now seen corresponding path program 5 times [2022-11-18 20:26:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:36,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547724193] [2022-11-18 20:26:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:36,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:36,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17542017] [2022-11-18 20:26:36,049 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:26:36,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:36,055 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:36,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2022-11-18 20:26:36,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-18 20:26:36,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:36,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:26:36,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 278 proven. 12 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2022-11-18 20:26:36,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 100 proven. 35 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-11-18 20:26:36,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:36,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547724193] [2022-11-18 20:26:36,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:36,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17542017] [2022-11-18 20:26:36,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17542017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:36,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:36,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-11-18 20:26:36,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412935559] [2022-11-18 20:26:36,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:37,020 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:37,020 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:37,020 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:37,020 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:37,020 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:26:37,020 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:37,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:37,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:37,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2022-11-18 20:26:37,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:37,021 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:37,021 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-18 20:26:37,024 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-18 20:26:37,028 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-18 20:26:37,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-18 20:26:37,031 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-18 20:26:37,056 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-18 20:26:37,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:37,155 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:26:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:37,162 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:37,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-11-18 20:26:37,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:37,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:37,175 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:37,175 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-18 20:26:37,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2022-11-18 20:26:37,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:37,178 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:37,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-11-18 20:26:37,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:37,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:37,193 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:37,193 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-18 20:26:37,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2022-11-18 20:26:37,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:37,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:37,201 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:37,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-11-18 20:26:37,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:37,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:37,237 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:37,237 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-18 20:26:37,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:37,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:37,242 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:37,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:37,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:37,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-11-18 20:26:37,267 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:37,267 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-18 20:26:37,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:37,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:37,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:37,272 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:37,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-11-18 20:26:37,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:37,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:37,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-11-18 20:26:37,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:37,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:37,294 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:37,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-11-18 20:26:37,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:26:37,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:38,012 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:26:38,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-11-18 20:26:38,017 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:38,017 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:38,017 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:38,017 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:38,017 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:26:38,017 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,017 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:38,017 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:38,017 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2022-11-18 20:26:38,017 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:38,017 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:38,018 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-18 20:26:38,021 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-18 20:26:38,023 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-18 20:26:38,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-18 20:26:38,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-18 20:26:38,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-18 20:26:38,150 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:38,151 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:26:38,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:38,152 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:38,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-11-18 20:26:38,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:38,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:38,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:38,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:38,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:38,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:38,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:38,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:38,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:38,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:38,171 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:38,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-11-18 20:26:38,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:38,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:38,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:38,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:38,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:38,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:38,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:38,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:38,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:38,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:38,201 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:38,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:38,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-11-18 20:26:38,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:38,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:38,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:38,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:38,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:38,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:38,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:38,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:38,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2022-11-18 20:26:38,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:38,220 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:38,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-11-18 20:26:38,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:38,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:38,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:38,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:38,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:38,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:38,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:38,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:38,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:38,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:38,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:38,238 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:38,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-11-18 20:26:38,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:38,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:38,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:38,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:38,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:38,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:38,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:38,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:38,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:38,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2022-11-18 20:26:38,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:38,257 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:38,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2022-11-18 20:26:38,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:38,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:38,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:38,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:38,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:38,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:38,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:38,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:38,278 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:26:38,282 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-18 20:26:38,282 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-18 20:26:38,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:38,284 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:38,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2022-11-18 20:26:38,290 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:26:38,290 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:26:38,290 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:26:38,291 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-18 20:26:38,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:38,296 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:26:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:38,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:26:38,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:38,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:38,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:26:38,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-18 20:26:39,052 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-18 20:26:39,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 706 states and 1155 transitions. cyclomatic complexity: 471 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-18 20:26:39,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 706 states and 1155 transitions. cyclomatic complexity: 471. 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 943 states and 1444 transitions. Complement of second has 38 states. [2022-11-18 20:26:39,268 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-18 20:26:39,269 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-18 20:26:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-11-18 20:26:39,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 52 transitions. Stem has 78 letters. Loop has 38 letters. [2022-11-18 20:26:39,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:39,273 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-18 20:26:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:39,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:26:39,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:39,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:26:39,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-18 20:26:40,018 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-18 20:26:40,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 706 states and 1155 transitions. cyclomatic complexity: 471 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-18 20:26:40,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 706 states and 1155 transitions. cyclomatic complexity: 471. 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 947 states and 1448 transitions. Complement of second has 42 states. [2022-11-18 20:26:40,270 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-18 20:26:40,270 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-18 20:26:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-11-18 20:26:40,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 78 letters. Loop has 38 letters. [2022-11-18 20:26:40,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:40,271 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-18 20:26:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:40,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:26:40,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:40,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:26:40,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-18 20:26:41,005 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-18 20:26:41,005 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 706 states and 1155 transitions. cyclomatic complexity: 471 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-18 20:26:41,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 706 states and 1155 transitions. cyclomatic complexity: 471. 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 1895 states and 2860 transitions. Complement of second has 72 states. [2022-11-18 20:26:41,335 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-18 20:26:41,336 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-18 20:26:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2022-11-18 20:26:41,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 102 transitions. Stem has 78 letters. Loop has 38 letters. [2022-11-18 20:26:41,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:41,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 102 transitions. Stem has 116 letters. Loop has 38 letters. [2022-11-18 20:26:41,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:41,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 102 transitions. Stem has 78 letters. Loop has 76 letters. [2022-11-18 20:26:41,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:41,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1895 states and 2860 transitions. [2022-11-18 20:26:41,355 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 145 [2022-11-18 20:26:41,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1895 states to 1366 states and 2074 transitions. [2022-11-18 20:26:41,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 457 [2022-11-18 20:26:41,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 474 [2022-11-18 20:26:41,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1366 states and 2074 transitions. [2022-11-18 20:26:41,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:41,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1366 states and 2074 transitions. [2022-11-18 20:26:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states and 2074 transitions. [2022-11-18 20:26:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1256. [2022-11-18 20:26:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 791 states have (on average 1.116308470290771) internal successors, (883), 787 states have internal predecessors, (883), 323 states have call successors, (340), 140 states have call predecessors, (340), 142 states have return successors, (712), 328 states have call predecessors, (712), 323 states have call successors, (712) [2022-11-18 20:26:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1935 transitions. [2022-11-18 20:26:41,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1256 states and 1935 transitions. [2022-11-18 20:26:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:26:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:26:41,431 INFO L87 Difference]: Start difference. First operand 1256 states and 1935 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-18 20:26:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:41,873 INFO L93 Difference]: Finished difference Result 1598 states and 2676 transitions. [2022-11-18 20:26:41,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1598 states and 2676 transitions. [2022-11-18 20:26:41,888 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 196 [2022-11-18 20:26:41,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1598 states to 1580 states and 2642 transitions. [2022-11-18 20:26:41,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 545 [2022-11-18 20:26:41,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 545 [2022-11-18 20:26:41,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1580 states and 2642 transitions. [2022-11-18 20:26:41,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:41,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1580 states and 2642 transitions. [2022-11-18 20:26:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states and 2642 transitions. [2022-11-18 20:26:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1488. [2022-11-18 20:26:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 900 states have (on average 1.12) internal successors, (1008), 900 states have internal predecessors, (1008), 446 states have call successors, (470), 140 states have call predecessors, (470), 142 states have return successors, (1005), 447 states have call predecessors, (1005), 446 states have call successors, (1005) [2022-11-18 20:26:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2483 transitions. [2022-11-18 20:26:41,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1488 states and 2483 transitions. [2022-11-18 20:26:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:26:41,964 INFO L428 stractBuchiCegarLoop]: Abstraction has 1488 states and 2483 transitions. [2022-11-18 20:26:41,964 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-11-18 20:26:41,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1488 states and 2483 transitions. [2022-11-18 20:26:41,971 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 172 [2022-11-18 20:26:41,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:41,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:41,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 12, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:41,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:41,973 INFO L748 eck$LassoCheckResult]: Stem: 54865#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 54830#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; 54831#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 54864#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; 54885#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 55519#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55515#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; 55513#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55514#factENTRY ~n := #in~n; 55520#L25 assume ~n <= 0;#res := 1; 55518#factFINAL assume true; 55512#factEXIT >#68#return; 55482#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55483#factENTRY ~n := #in~n; 55510#L25 assume ~n <= 0;#res := 1; 55508#factFINAL assume true; 55481#factEXIT >#70#return; 55479#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55480#factENTRY ~n := #in~n; 55499#L25 assume ~n <= 0;#res := 1; 55497#factFINAL assume true; 55478#factEXIT >#72#return; 55474#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; 55471#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 55472#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 55517#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55349#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; 55346#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55348#factENTRY ~n := #in~n; 55408#L25 assume !(~n <= 0); 55401#L26 call #t~ret0 := fact(~n - 1);< 55404#factENTRY ~n := #in~n; 55409#L25 assume ~n <= 0;#res := 1; 55405#factFINAL assume true; 55400#factEXIT >#66#return; 55399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55397#factFINAL assume true; 55345#factEXIT >#74#return; 55341#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55343#factENTRY ~n := #in~n; 55398#L25 assume ~n <= 0;#res := 1; 55396#factFINAL assume true; 55339#factEXIT >#76#return; 55335#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55337#factENTRY ~n := #in~n; 55425#L25 assume !(~n <= 0); 55422#L26 call #t~ret0 := fact(~n - 1);< 55424#factENTRY ~n := #in~n; 55544#L25 assume ~n <= 0;#res := 1; 55545#factFINAL assume true; 55421#factEXIT >#66#return; 55423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55868#factFINAL assume true; 55334#factEXIT >#78#return; 55275#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; 55274#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 55273#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 55148#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 55142#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 55143#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 55860#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55858#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; 55761#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55844#factENTRY ~n := #in~n; 55839#L25 assume ~n <= 0;#res := 1; 55840#factFINAL assume true; 56028#factEXIT >#68#return; 54877#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54878#factENTRY ~n := #in~n; 56059#L25 assume ~n <= 0;#res := 1; 56026#factFINAL assume true; 56021#factEXIT >#70#return; 56023#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54880#factENTRY ~n := #in~n; 56093#L25 assume ~n <= 0;#res := 1; 56092#factFINAL assume true; 56089#factEXIT >#72#return; 56090#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; 56203#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 56201#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56200#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56199#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; 56055#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54805#factENTRY ~n := #in~n; 56196#L25 assume !(~n <= 0); 55806#L26 call #t~ret0 := fact(~n - 1);< 55854#factENTRY ~n := #in~n; 55828#L25 assume ~n <= 0;#res := 1; 55823#factFINAL assume true; 55802#factEXIT >#66#return; 55815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56063#factFINAL assume true; 56029#factEXIT >#74#return; 56012#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54881#factENTRY ~n := #in~n; 56061#L25 assume ~n <= 0;#res := 1; 56027#factFINAL assume true; 56024#factEXIT >#76#return; 55655#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54887#factENTRY ~n := #in~n; 56232#L25 assume !(~n <= 0); 55621#L26 call #t~ret0 := fact(~n - 1);< 55653#factENTRY ~n := #in~n; 55658#L25 assume ~n <= 0;#res := 1; 55659#factFINAL assume true; 55610#factEXIT >#66#return; 55633#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56177#factFINAL assume true; 56176#factEXIT >#78#return; 55981#L30-8 [2022-11-18 20:26:41,973 INFO L750 eck$LassoCheckResult]: Loop: 55981#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; 56162#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 56160#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56158#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56142#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; 55944#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54803#factENTRY ~n := #in~n; 55970#L25 assume !(~n <= 0); 55615#L26 call #t~ret0 := fact(~n - 1);< 55653#factENTRY ~n := #in~n; 55650#L25 assume !(~n <= 0); 55642#L26 call #t~ret0 := fact(~n - 1);< 55649#factENTRY ~n := #in~n; 55650#L25 assume !(~n <= 0); 55642#L26 call #t~ret0 := fact(~n - 1);< 55649#factENTRY ~n := #in~n; 55652#L25 assume ~n <= 0;#res := 1; 55681#factFINAL assume true; 55665#factEXIT >#66#return; 55667#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55638#factFINAL assume true; 55646#factEXIT >#66#return; 55660#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55661#factFINAL assume true; 55668#factEXIT >#66#return; 55670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56122#factFINAL assume true; 56114#factEXIT >#74#return; 55956#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54803#factENTRY ~n := #in~n; 55970#L25 assume !(~n <= 0); 55615#L26 call #t~ret0 := fact(~n - 1);< 55653#factENTRY ~n := #in~n; 55650#L25 assume !(~n <= 0); 55642#L26 call #t~ret0 := fact(~n - 1);< 55649#factENTRY ~n := #in~n; 55650#L25 assume !(~n <= 0); 55642#L26 call #t~ret0 := fact(~n - 1);< 55649#factENTRY ~n := #in~n; 55652#L25 assume ~n <= 0;#res := 1; 55681#factFINAL assume true; 55665#factEXIT >#66#return; 55667#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55638#factFINAL assume true; 55646#factEXIT >#66#return; 55660#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55661#factFINAL assume true; 55668#factEXIT >#66#return; 55670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56122#factFINAL assume true; 56114#factEXIT >#76#return; 55972#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55992#factENTRY ~n := #in~n; 55994#L25 assume !(~n <= 0); 55615#L26 call #t~ret0 := fact(~n - 1);< 55653#factENTRY ~n := #in~n; 55650#L25 assume !(~n <= 0); 55642#L26 call #t~ret0 := fact(~n - 1);< 55649#factENTRY ~n := #in~n; 55650#L25 assume !(~n <= 0); 55642#L26 call #t~ret0 := fact(~n - 1);< 55649#factENTRY ~n := #in~n; 55652#L25 assume ~n <= 0;#res := 1; 55681#factFINAL assume true; 55665#factEXIT >#66#return; 55667#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55638#factFINAL assume true; 55646#factEXIT >#66#return; 55660#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55661#factFINAL assume true; 55668#factEXIT >#66#return; 55670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56122#factFINAL assume true; 56114#factEXIT >#78#return; 55981#L30-8 [2022-11-18 20:26:41,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -867238810, now seen corresponding path program 6 times [2022-11-18 20:26:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:41,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379593177] [2022-11-18 20:26:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:41,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:41,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981831431] [2022-11-18 20:26:41,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:26:41,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:41,983 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:41,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2022-11-18 20:26:42,066 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-18 20:26:42,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:42,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:26:42,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 249 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-11-18 20:26:42,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2022-11-18 20:26:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:42,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379593177] [2022-11-18 20:26:42,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:42,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981831431] [2022-11-18 20:26:42,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981831431] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:42,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:42,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-18 20:26:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610776689] [2022-11-18 20:26:42,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:42,280 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1678442820, now seen corresponding path program 3 times [2022-11-18 20:26:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:42,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032430606] [2022-11-18 20:26:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:42,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:42,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723315726] [2022-11-18 20:26:42,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:26:42,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:42,287 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:42,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2022-11-18 20:26:42,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-18 20:26:42,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:42,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:26:42,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 48 proven. 179 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-18 20:26:42,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 48 proven. 204 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-18 20:26:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032430606] [2022-11-18 20:26:43,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:43,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723315726] [2022-11-18 20:26:43,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723315726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:43,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:43,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 22 [2022-11-18 20:26:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751845184] [2022-11-18 20:26:43,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:43,535 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:43,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:26:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:26:43,536 INFO L87 Difference]: Start difference. First operand 1488 states and 2483 transitions. cyclomatic complexity: 1034 Second operand has 23 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 13 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2022-11-18 20:26:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:44,579 INFO L93 Difference]: Finished difference Result 3291 states and 6080 transitions. [2022-11-18 20:26:44,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3291 states and 6080 transitions. [2022-11-18 20:26:44,602 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 591 [2022-11-18 20:26:44,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3291 states to 3184 states and 5707 transitions. [2022-11-18 20:26:44,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1127 [2022-11-18 20:26:44,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1130 [2022-11-18 20:26:44,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3184 states and 5707 transitions. [2022-11-18 20:26:44,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:44,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3184 states and 5707 transitions. [2022-11-18 20:26:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states and 5707 transitions. [2022-11-18 20:26:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 1715. [2022-11-18 20:26:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 970 states have (on average 1.1144329896907217) internal successors, (1081), 968 states have internal predecessors, (1081), 578 states have call successors, (602), 151 states have call predecessors, (602), 167 states have return successors, (1760), 595 states have call predecessors, (1760), 578 states have call successors, (1760) [2022-11-18 20:26:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 3443 transitions. [2022-11-18 20:26:44,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1715 states and 3443 transitions. [2022-11-18 20:26:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:26:44,750 INFO L428 stractBuchiCegarLoop]: Abstraction has 1715 states and 3443 transitions. [2022-11-18 20:26:44,750 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-11-18 20:26:44,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1715 states and 3443 transitions. [2022-11-18 20:26:44,761 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 211 [2022-11-18 20:26:44,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:44,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:44,762 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 12, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:44,762 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:44,762 INFO L748 eck$LassoCheckResult]: Stem: 60796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 60765#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; 60766#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 60795#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; 60817#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 61201#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61200#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; 61195#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61199#factENTRY ~n := #in~n; 61194#L25 assume ~n <= 0;#res := 1; 61196#factFINAL assume true; 61457#factEXIT >#68#return; 60811#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60812#factENTRY ~n := #in~n; 61725#L25 assume ~n <= 0;#res := 1; 61722#factFINAL assume true; 61720#factEXIT >#70#return; 60748#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60749#factENTRY ~n := #in~n; 61807#L25 assume ~n <= 0;#res := 1; 61806#factFINAL assume true; 61804#factEXIT >#72#return; 61805#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; 60790#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60791#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 62326#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62325#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; 61752#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61753#factENTRY ~n := #in~n; 61769#L25 assume !(~n <= 0); 60776#L26 call #t~ret0 := fact(~n - 1);< 61768#factENTRY ~n := #in~n; 61774#L25 assume ~n <= 0;#res := 1; 61770#factFINAL assume true; 61766#factEXIT >#66#return; 61765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61764#factFINAL assume true; 61751#factEXIT >#74#return; 61748#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61750#factENTRY ~n := #in~n; 61779#L25 assume ~n <= 0;#res := 1; 61778#factFINAL assume true; 61746#factEXIT >#76#return; 61743#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61744#factENTRY ~n := #in~n; 61786#L25 assume !(~n <= 0); 61783#L26 call #t~ret0 := fact(~n - 1);< 61784#factENTRY ~n := #in~n; 61787#L25 assume ~n <= 0;#res := 1; 61785#factFINAL assume true; 61782#factEXIT >#66#return; 61780#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61745#factFINAL assume true; 61741#factEXIT >#78#return; 61739#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; 61737#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 61735#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61734#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 61732#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 61731#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 61729#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61579#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; 61512#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61516#factENTRY ~n := #in~n; 61545#L25 assume ~n <= 0;#res := 1; 61533#factFINAL assume true; 61511#factEXIT >#68#return; 61503#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61504#factENTRY ~n := #in~n; 61517#L25 assume ~n <= 0;#res := 1; 61510#factFINAL assume true; 61501#factEXIT >#70#return; 61484#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61481#factENTRY ~n := #in~n; 61530#L25 assume ~n <= 0;#res := 1; 61531#factFINAL assume true; 61483#factEXIT >#72#return; 61486#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; 61814#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 61815#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61810#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61811#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; 60859#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60914#factENTRY ~n := #in~n; 61557#L25 assume !(~n <= 0); 61207#L26 call #t~ret0 := fact(~n - 1);< 61529#factENTRY ~n := #in~n; 61227#L25 assume ~n <= 0;#res := 1; 61224#factFINAL assume true; 61202#factEXIT >#66#return; 61197#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61198#factFINAL assume true; 60823#factEXIT >#74#return; 60880#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61482#factENTRY ~n := #in~n; 62123#L25 assume ~n <= 0;#res := 1; 62124#factFINAL assume true; 62171#factEXIT >#76#return; 60739#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60818#factENTRY ~n := #in~n; 62174#L25 assume !(~n <= 0); 61911#L26 call #t~ret0 := fact(~n - 1);< 62068#factENTRY ~n := #in~n; 62072#L25 assume ~n <= 0;#res := 1; 62069#factFINAL assume true; 62052#factEXIT >#66#return; 62062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62288#factFINAL assume true; 62287#factEXIT >#78#return; 60741#L30-8 [2022-11-18 20:26:44,763 INFO L750 eck$LassoCheckResult]: Loop: 60741#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; 62214#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 62210#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 62185#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62108#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; 61976#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61973#factENTRY ~n := #in~n; 62010#L25 assume !(~n <= 0); 61909#L26 call #t~ret0 := fact(~n - 1);< 62068#factENTRY ~n := #in~n; 61930#L25 assume !(~n <= 0); 61907#L26 call #t~ret0 := fact(~n - 1);< 61929#factENTRY ~n := #in~n; 61930#L25 assume !(~n <= 0); 61907#L26 call #t~ret0 := fact(~n - 1);< 61929#factENTRY ~n := #in~n; 61931#L25 assume ~n <= 0;#res := 1; 61961#factFINAL assume true; 61958#factEXIT >#66#return; 61957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61956#factFINAL assume true; 61945#factEXIT >#66#return; 61955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62091#factFINAL assume true; 62087#factEXIT >#66#return; 62089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62180#factFINAL assume true; 62179#factEXIT >#74#return; 62002#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61973#factENTRY ~n := #in~n; 62010#L25 assume !(~n <= 0); 61909#L26 call #t~ret0 := fact(~n - 1);< 62068#factENTRY ~n := #in~n; 62072#L25 assume ~n <= 0;#res := 1; 62069#factFINAL assume true; 62052#factEXIT >#66#return; 62064#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62113#factFINAL assume true; 62112#factEXIT >#76#return; 62018#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62037#factENTRY ~n := #in~n; 62070#L25 assume !(~n <= 0); 61947#L26 call #t~ret0 := fact(~n - 1);< 61926#factENTRY ~n := #in~n; 62072#L25 assume ~n <= 0;#res := 1; 62069#factFINAL assume true; 62052#factEXIT >#66#return; 62064#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62113#factFINAL assume true; 62112#factEXIT >#78#return; 60741#L30-8 [2022-11-18 20:26:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:44,763 INFO L85 PathProgramCache]: Analyzing trace with hash -867238810, now seen corresponding path program 7 times [2022-11-18 20:26:44,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:44,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749685462] [2022-11-18 20:26:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:44,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908426776] [2022-11-18 20:26:44,771 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:26:44,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:44,779 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:44,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2022-11-18 20:26:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:44,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:26:44,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 306 proven. 1 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-11-18 20:26:44,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 46 proven. 22 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-11-18 20:26:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749685462] [2022-11-18 20:26:45,068 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908426776] [2022-11-18 20:26:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908426776] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:45,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:45,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-18 20:26:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061758460] [2022-11-18 20:26:45,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:45,069 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:45,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1069256388, now seen corresponding path program 4 times [2022-11-18 20:26:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:45,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990931379] [2022-11-18 20:26:45,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:45,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:45,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556369990] [2022-11-18 20:26:45,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:26:45,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:45,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:45,075 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:45,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2022-11-18 20:26:45,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:26:45,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:45,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:26:45,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-18 20:26:45,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-18 20:26:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:45,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990931379] [2022-11-18 20:26:45,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:45,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556369990] [2022-11-18 20:26:45,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556369990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:45,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:45,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2022-11-18 20:26:45,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109267999] [2022-11-18 20:26:45,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:45,736 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:45,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:45,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:26:45,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:26:45,737 INFO L87 Difference]: Start difference. First operand 1715 states and 3443 transitions. cyclomatic complexity: 1767 Second operand has 17 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (12), 8 states have call predecessors, (12), 10 states have call successors, (12) [2022-11-18 20:26:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:46,220 INFO L93 Difference]: Finished difference Result 2568 states and 4731 transitions. [2022-11-18 20:26:46,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2568 states and 4731 transitions. [2022-11-18 20:26:46,245 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 435 [2022-11-18 20:26:46,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2568 states to 2529 states and 4640 transitions. [2022-11-18 20:26:46,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 870 [2022-11-18 20:26:46,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 870 [2022-11-18 20:26:46,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2529 states and 4640 transitions. [2022-11-18 20:26:46,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:46,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2529 states and 4640 transitions. [2022-11-18 20:26:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states and 4640 transitions. [2022-11-18 20:26:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 1756. [2022-11-18 20:26:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 980 states have (on average 1.113265306122449) internal successors, (1091), 976 states have internal predecessors, (1091), 609 states have call successors, (633), 157 states have call predecessors, (633), 167 states have return successors, (1746), 622 states have call predecessors, (1746), 609 states have call successors, (1746) [2022-11-18 20:26:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 3470 transitions. [2022-11-18 20:26:46,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1756 states and 3470 transitions. [2022-11-18 20:26:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:26:46,370 INFO L428 stractBuchiCegarLoop]: Abstraction has 1756 states and 3470 transitions. [2022-11-18 20:26:46,370 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-11-18 20:26:46,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1756 states and 3470 transitions. [2022-11-18 20:26:46,380 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 223 [2022-11-18 20:26:46,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:46,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:46,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 12, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:46,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:46,382 INFO L748 eck$LassoCheckResult]: Stem: 66092#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 66060#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; 66061#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 66091#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; 66120#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 66987#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66985#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; 66981#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66982#factENTRY ~n := #in~n; 66986#L25 assume ~n <= 0;#res := 1; 66984#factFINAL assume true; 66980#factEXIT >#68#return; 66976#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66977#factENTRY ~n := #in~n; 66983#L25 assume ~n <= 0;#res := 1; 66979#factFINAL assume true; 66975#factEXIT >#70#return; 66972#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66973#factENTRY ~n := #in~n; 66978#L25 assume ~n <= 0;#res := 1; 66974#factFINAL assume true; 66971#factEXIT >#72#return; 66970#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; 66969#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 66968#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 66967#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66448#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; 66383#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66384#factENTRY ~n := #in~n; 66395#L25 assume !(~n <= 0); 66389#L26 call #t~ret0 := fact(~n - 1);< 66391#factENTRY ~n := #in~n; 66396#L25 assume ~n <= 0;#res := 1; 66392#factFINAL assume true; 66387#factEXIT >#66#return; 66386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66385#factFINAL assume true; 66381#factEXIT >#74#return; 66373#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 66375#factENTRY ~n := #in~n; 66377#L25 assume ~n <= 0;#res := 1; 66376#factFINAL assume true; 66371#factEXIT >#76#return; 66358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66359#factENTRY ~n := #in~n; 66366#L25 assume !(~n <= 0); 66363#L26 call #t~ret0 := fact(~n - 1);< 66364#factENTRY ~n := #in~n; 66367#L25 assume ~n <= 0;#res := 1; 66365#factFINAL assume true; 66362#factEXIT >#66#return; 66361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 66360#factFINAL assume true; 66356#factEXIT >#78#return; 66355#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; 66354#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 66353#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 66352#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 66350#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 66347#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 66345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66343#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; 66281#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66290#factENTRY ~n := #in~n; 66280#L25 assume ~n <= 0;#res := 1; 66283#factFINAL assume true; 66320#factEXIT >#68#return; 67360#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 67362#factENTRY ~n := #in~n; 67368#L25 assume ~n <= 0;#res := 1; 67366#factFINAL assume true; 67358#factEXIT >#70#return; 67361#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 67327#factENTRY ~n := #in~n; 67379#L25 assume ~n <= 0;#res := 1; 67378#factFINAL assume true; 67373#factEXIT >#72#return; 67374#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; 67657#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 67655#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 67653#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 67651#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; 67062#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 66117#factENTRY ~n := #in~n; 67551#L25 assume !(~n <= 0); 67119#L26 call #t~ret0 := fact(~n - 1);< 67411#factENTRY ~n := #in~n; 67134#L25 assume ~n <= 0;#res := 1; 67130#factFINAL assume true; 67111#factEXIT >#66#return; 67124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67061#factFINAL assume true; 67101#factEXIT >#74#return; 67325#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 67326#factENTRY ~n := #in~n; 67351#L25 assume ~n <= 0;#res := 1; 67346#factFINAL assume true; 67330#factEXIT >#76#return; 66007#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 66121#factENTRY ~n := #in~n; 67695#L25 assume !(~n <= 0); 67152#L26 call #t~ret0 := fact(~n - 1);< 67247#factENTRY ~n := #in~n; 67262#L25 assume ~n <= 0;#res := 1; 67259#factFINAL assume true; 67232#factEXIT >#66#return; 67240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67736#factFINAL assume true; 67734#factEXIT >#78#return; 66011#L30-8 [2022-11-18 20:26:46,383 INFO L750 eck$LassoCheckResult]: Loop: 66011#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; 67748#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 66118#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 66098#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 66099#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; 66199#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 67219#factENTRY ~n := #in~n; 67276#L25 assume !(~n <= 0); 67158#L26 call #t~ret0 := fact(~n - 1);< 67247#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67177#L25 assume ~n <= 0;#res := 1; 67191#factFINAL assume true; 67181#factEXIT >#66#return; 67183#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67198#factFINAL assume true; 67193#factEXIT >#66#return; 67178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67171#factFINAL assume true; 67146#factEXIT >#66#return; 67161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67258#factFINAL assume true; 67251#factEXIT >#66#return; 67252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67257#factFINAL assume true; 67255#factEXIT >#66#return; 67256#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67289#factFINAL assume true; 67288#factEXIT >#74#return; 66179#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 67219#factENTRY ~n := #in~n; 67276#L25 assume !(~n <= 0); 67158#L26 call #t~ret0 := fact(~n - 1);< 67247#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67177#L25 assume ~n <= 0;#res := 1; 67191#factFINAL assume true; 67181#factEXIT >#66#return; 67183#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67198#factFINAL assume true; 67193#factEXIT >#66#return; 67178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67171#factFINAL assume true; 67146#factEXIT >#66#return; 67162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67290#factFINAL assume true; 67282#factEXIT >#76#return; 66193#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 67279#factENTRY ~n := #in~n; 67261#L25 assume !(~n <= 0); 67158#L26 call #t~ret0 := fact(~n - 1);< 67247#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67175#L25 assume !(~n <= 0); 67147#L26 call #t~ret0 := fact(~n - 1);< 67172#factENTRY ~n := #in~n; 67177#L25 assume ~n <= 0;#res := 1; 67191#factFINAL assume true; 67181#factEXIT >#66#return; 67183#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67198#factFINAL assume true; 67193#factEXIT >#66#return; 67178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67171#factFINAL assume true; 67146#factEXIT >#66#return; 67162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 67290#factFINAL assume true; 67282#factEXIT >#78#return; 66011#L30-8 [2022-11-18 20:26:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -867238810, now seen corresponding path program 8 times [2022-11-18 20:26:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:46,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096840237] [2022-11-18 20:26:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:46,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:46,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100011973] [2022-11-18 20:26:46,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:26:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:46,395 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:46,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2022-11-18 20:26:46,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:26:46,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:46,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:26:46,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 233 proven. 22 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-11-18 20:26:46,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2022-11-18 20:26:46,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:46,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096840237] [2022-11-18 20:26:46,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:46,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100011973] [2022-11-18 20:26:46,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100011973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:46,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:46,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-18 20:26:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310947583] [2022-11-18 20:26:46,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:46,814 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1233970812, now seen corresponding path program 5 times [2022-11-18 20:26:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:46,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438453865] [2022-11-18 20:26:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:46,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:46,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756000828] [2022-11-18 20:26:46,819 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:26:46,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:46,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:46,831 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:46,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2022-11-18 20:26:46,933 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-11-18 20:26:46,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:46,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 20:26:46,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 48 proven. 276 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-18 20:26:47,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 48 proven. 317 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-18 20:26:48,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:48,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438453865] [2022-11-18 20:26:48,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:48,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756000828] [2022-11-18 20:26:48,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756000828] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:48,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:48,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 24 [2022-11-18 20:26:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135426594] [2022-11-18 20:26:48,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:48,723 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:48,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:26:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-11-18 20:26:48,724 INFO L87 Difference]: Start difference. First operand 1756 states and 3470 transitions. cyclomatic complexity: 1753 Second operand has 25 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 14 states have call successors, (20) [2022-11-18 20:26:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:49,678 INFO L93 Difference]: Finished difference Result 3258 states and 6271 transitions. [2022-11-18 20:26:49,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3258 states and 6271 transitions. [2022-11-18 20:26:49,705 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 550 [2022-11-18 20:26:49,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3258 states to 3254 states and 6267 transitions. [2022-11-18 20:26:49,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1134 [2022-11-18 20:26:49,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2022-11-18 20:26:49,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3254 states and 6267 transitions. [2022-11-18 20:26:49,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:49,747 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3254 states and 6267 transitions. [2022-11-18 20:26:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states and 6267 transitions. [2022-11-18 20:26:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 1768. [2022-11-18 20:26:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 988 states have (on average 1.1123481781376519) internal successors, (1099), 984 states have internal predecessors, (1099), 609 states have call successors, (633), 157 states have call predecessors, (633), 171 states have return successors, (1783), 626 states have call predecessors, (1783), 609 states have call successors, (1783) [2022-11-18 20:26:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 3515 transitions. [2022-11-18 20:26:49,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1768 states and 3515 transitions. [2022-11-18 20:26:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:26:49,862 INFO L428 stractBuchiCegarLoop]: Abstraction has 1768 states and 3515 transitions. [2022-11-18 20:26:49,862 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-11-18 20:26:49,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1768 states and 3515 transitions. [2022-11-18 20:26:49,872 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 223 [2022-11-18 20:26:49,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:49,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:49,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 12, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:49,873 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-18 20:26:49,874 INFO L748 eck$LassoCheckResult]: Stem: 72326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 72284#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; 72285#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 72325#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; 72351#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 72710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 72709#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; 72361#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72708#factENTRY ~n := #in~n; 72659#L25 assume ~n <= 0;#res := 1; 72660#factFINAL assume true; 72360#factEXIT >#68#return; 72362#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73150#factENTRY ~n := #in~n; 73153#L25 assume ~n <= 0;#res := 1; 73152#factFINAL assume true; 73149#factEXIT >#70#return; 73146#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73147#factENTRY ~n := #in~n; 73151#L25 assume ~n <= 0;#res := 1; 73148#factFINAL assume true; 73145#factEXIT >#72#return; 73144#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; 73142#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 73143#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73165#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73166#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; 73047#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73066#factENTRY ~n := #in~n; 73067#L25 assume !(~n <= 0); 73063#L26 call #t~ret0 := fact(~n - 1);< 73064#factENTRY ~n := #in~n; 73089#L25 assume ~n <= 0;#res := 1; 73088#factFINAL assume true; 73086#factEXIT >#66#return; 73085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73084#factFINAL assume true; 73045#factEXIT >#74#return; 73034#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73037#factENTRY ~n := #in~n; 73041#L25 assume ~n <= 0;#res := 1; 73042#factFINAL assume true; 73032#factEXIT >#76#return; 73030#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73031#factENTRY ~n := #in~n; 73196#L25 assume !(~n <= 0); 73193#L26 call #t~ret0 := fact(~n - 1);< 73195#factENTRY ~n := #in~n; 73218#L25 assume ~n <= 0;#res := 1; 73219#factFINAL assume true; 73192#factEXIT >#66#return; 73194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73428#factFINAL assume true; 73427#factEXIT >#78#return; 73426#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; 73425#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 73422#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73419#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 73416#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 73414#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 73412#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73409#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; 73278#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73281#factENTRY ~n := #in~n; 73283#L25 assume ~n <= 0;#res := 1; 73282#factFINAL assume true; 73276#factEXIT >#68#return; 73250#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73252#factENTRY ~n := #in~n; 73275#L25 assume ~n <= 0;#res := 1; 73274#factFINAL assume true; 73249#factEXIT >#70#return; 73245#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73231#factENTRY ~n := #in~n; 73272#L25 assume ~n <= 0;#res := 1; 73273#factFINAL assume true; 73320#factEXIT >#72#return; 73322#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; 73445#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 73441#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73442#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73402#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; 72704#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 72349#factENTRY ~n := #in~n; 73302#L25 assume !(~n <= 0); 72712#L26 call #t~ret0 := fact(~n - 1);< 73271#factENTRY ~n := #in~n; 72736#L25 assume ~n <= 0;#res := 1; 72733#factFINAL assume true; 72711#factEXIT >#66#return; 72661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 72707#factFINAL assume true; 73009#factEXIT >#74#return; 73023#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73232#factENTRY ~n := #in~n; 73858#L25 assume ~n <= 0;#res := 1; 73856#factFINAL assume true; 73853#factEXIT >#76#return; 72271#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 72352#factENTRY ~n := #in~n; 73981#L25 assume !(~n <= 0); 72300#L26 call #t~ret0 := fact(~n - 1);< 73766#factENTRY ~n := #in~n; 73780#L25 assume ~n <= 0;#res := 1; 73768#factFINAL assume true; 73751#factEXIT >#66#return; 73761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73982#factFINAL assume true; 73931#factEXIT >#78#return; 73722#L30-8 [2022-11-18 20:26:49,874 INFO L750 eck$LassoCheckResult]: Loop: 73722#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; 73825#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 73820#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73807#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73785#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; 73687#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73663#factENTRY ~n := #in~n; 73700#L25 assume !(~n <= 0); 72299#L26 call #t~ret0 := fact(~n - 1);< 73766#factENTRY ~n := #in~n; 73403#L25 assume !(~n <= 0); 72293#L26 call #t~ret0 := fact(~n - 1);< 72307#factENTRY ~n := #in~n; 73408#L25 assume ~n <= 0;#res := 1; 73652#factFINAL assume true; 73649#factEXIT >#66#return; 73648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73645#factFINAL assume true; 73618#factEXIT >#66#return; 73627#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73734#factFINAL assume true; 73703#factEXIT >#74#return; 73682#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73663#factENTRY ~n := #in~n; 73700#L25 assume !(~n <= 0); 72299#L26 call #t~ret0 := fact(~n - 1);< 73766#factENTRY ~n := #in~n; 73780#L25 assume ~n <= 0;#res := 1; 73768#factFINAL assume true; 73751#factEXIT >#66#return; 73758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73809#factFINAL assume true; 73808#factEXIT >#76#return; 73728#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73810#factENTRY ~n := #in~n; 73811#L25 assume !(~n <= 0); 73757#L26 call #t~ret0 := fact(~n - 1);< 72292#factENTRY ~n := #in~n; 73780#L25 assume ~n <= 0;#res := 1; 73768#factFINAL assume true; 73751#factEXIT >#66#return; 73758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73809#factFINAL assume true; 73808#factEXIT >#78#return; 73722#L30-8 [2022-11-18 20:26:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash -867238810, now seen corresponding path program 9 times [2022-11-18 20:26:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:49,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770113159] [2022-11-18 20:26:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:49,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:49,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890518514] [2022-11-18 20:26:49,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:26:49,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:49,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:49,887 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:49,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2022-11-18 20:26:49,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:26:49,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:49,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:26:49,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 249 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-11-18 20:26:50,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2022-11-18 20:26:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770113159] [2022-11-18 20:26:50,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890518514] [2022-11-18 20:26:50,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890518514] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:50,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:50,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-18 20:26:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993002164] [2022-11-18 20:26:50,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:50,244 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:50,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2024169972, now seen corresponding path program 6 times [2022-11-18 20:26:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:50,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755908640] [2022-11-18 20:26:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:50,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:50,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527213827] [2022-11-18 20:26:50,249 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:26:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:50,255 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:50,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2022-11-18 20:26:50,354 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-18 20:26:50,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:26:50,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:50,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:26:50,897 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:50,897 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:50,897 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:50,897 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:50,897 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-18 20:26:50,897 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:50,897 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:50,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:50,897 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-18 20:26:50,897 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:50,897 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:50,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-18 20:26:50,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-18 20:26:50,931 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-18 20:26:50,933 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-18 20:26:51,041 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:51,041 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-18 20:26:51,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:51,043 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:51,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2022-11-18 20:26:51,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:51,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:51,057 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-18 20:26:51,057 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-18 20:26:51,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:51,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:51,061 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:51,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-11-18 20:26:51,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-18 20:26:51,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:51,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:51,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:51,082 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:51,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-11-18 20:26:51,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-18 20:26:51,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-18 20:26:51,112 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-18 20:26:51,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2022-11-18 20:26:51,114 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:26:51,114 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-18 20:26:51,114 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-18 20:26:51,115 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-18 20:26:51,115 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-18 20:26:51,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-18 20:26:51,115 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-18 20:26:51,115 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-18 20:26:51,115 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-18 20:26:51,115 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-18 20:26:51,116 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-18 20:26:51,118 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-18 20:26:51,126 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-18 20:26:51,154 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-18 20:26:51,268 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-18 20:26:51,269 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-18 20:26:51,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:51,270 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:51,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-11-18 20:26:51,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:51,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:51,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:51,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:51,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:51,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:51,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:51,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:51,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:51,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2022-11-18 20:26:51,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:51,288 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:51,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-11-18 20:26:51,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-18 20:26:51,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:51,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:51,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:51,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:51,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:51,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:51,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:51,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-18 20:26:51,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:51,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:51,307 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:51,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-11-18 20:26:51,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-18 20:26:51,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-18 20:26:51,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-18 20:26:51,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-18 20:26:51,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-18 20:26:51,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-18 20:26:51,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-18 20:26:51,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-18 20:26:51,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-18 20:26:51,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-18 20:26:51,334 INFO L444 ModelExtractionUtils]: 9 out of 12 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-18 20:26:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-18 20:26:51,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:51,337 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-18 20:26:51,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-11-18 20:26:51,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-18 20:26:51,338 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-18 20:26:51,338 INFO L513 LassoAnalysis]: Proved termination. [2022-11-18 20:26:51,338 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-18 20:26:51,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:51,341 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-18 20:26:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:51,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 20:26:51,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:52,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:52,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:26:52,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:52,372 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-18 20:26:52,373 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-18 20:26:52,373 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1768 states and 3515 transitions. cyclomatic complexity: 1786 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-18 20:26:52,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1768 states and 3515 transitions. cyclomatic complexity: 1786. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 2250 states and 4065 transitions. Complement of second has 45 states. [2022-11-18 20:26:52,675 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-18 20:26:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-18 20:26:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-11-18 20:26:52,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 109 letters. Loop has 44 letters. [2022-11-18 20:26:52,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:52,676 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-18 20:26:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:52,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 20:26:52,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:53,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:26:53,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:53,725 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-18 20:26:53,726 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2022-11-18 20:26:53,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1768 states and 3515 transitions. cyclomatic complexity: 1786 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-18 20:26:54,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1768 states and 3515 transitions. cyclomatic complexity: 1786. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 2243 states and 4045 transitions. Complement of second has 43 states. [2022-11-18 20:26:54,088 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-18 20:26:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-18 20:26:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-11-18 20:26:54,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 109 letters. Loop has 44 letters. [2022-11-18 20:26:54,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:54,090 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-18 20:26:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:54,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 20:26:54,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:54,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:26:54,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:55,070 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-18 20:26:55,071 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 9 loop predicates [2022-11-18 20:26:55,071 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1768 states and 3515 transitions. cyclomatic complexity: 1786 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-18 20:26:55,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1768 states and 3515 transitions. cyclomatic complexity: 1786. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 4855 states and 8813 transitions. Complement of second has 57 states. [2022-11-18 20:26:55,558 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-18 20:26:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-18 20:26:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2022-11-18 20:26:55,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 102 transitions. Stem has 109 letters. Loop has 44 letters. [2022-11-18 20:26:55,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:55,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 102 transitions. Stem has 153 letters. Loop has 44 letters. [2022-11-18 20:26:55,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:55,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 102 transitions. Stem has 109 letters. Loop has 88 letters. [2022-11-18 20:26:55,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-18 20:26:55,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4855 states and 8813 transitions. [2022-11-18 20:26:55,610 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 300 [2022-11-18 20:26:55,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4855 states to 3844 states and 7065 transitions. [2022-11-18 20:26:55,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 947 [2022-11-18 20:26:55,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 967 [2022-11-18 20:26:55,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3844 states and 7065 transitions. [2022-11-18 20:26:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:55,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3844 states and 7065 transitions. [2022-11-18 20:26:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states and 7065 transitions. [2022-11-18 20:26:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3161. [2022-11-18 20:26:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 1787 states have (on average 1.1001678791270286) internal successors, (1966), 1785 states have internal predecessors, (1966), 1001 states have call successors, (1068), 318 states have call predecessors, (1068), 373 states have return successors, (2791), 1057 states have call predecessors, (2791), 1001 states have call successors, (2791) [2022-11-18 20:26:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 5825 transitions. [2022-11-18 20:26:55,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3161 states and 5825 transitions. [2022-11-18 20:26:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:26:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:26:55,784 INFO L87 Difference]: Start difference. First operand 3161 states and 5825 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2022-11-18 20:26:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:55,911 INFO L93 Difference]: Finished difference Result 2258 states and 3607 transitions. [2022-11-18 20:26:55,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2258 states and 3607 transitions. [2022-11-18 20:26:55,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 236 [2022-11-18 20:26:55,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2258 states to 2216 states and 3546 transitions. [2022-11-18 20:26:55,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 605 [2022-11-18 20:26:55,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2022-11-18 20:26:55,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2216 states and 3546 transitions. [2022-11-18 20:26:55,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:55,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2216 states and 3546 transitions. [2022-11-18 20:26:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states and 3546 transitions. [2022-11-18 20:26:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2096. [2022-11-18 20:26:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1276 states have (on average 1.078369905956113) internal successors, (1376), 1267 states have internal predecessors, (1376), 512 states have call successors, (536), 261 states have call predecessors, (536), 308 states have return successors, (1435), 567 states have call predecessors, (1435), 512 states have call successors, (1435) [2022-11-18 20:26:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3347 transitions. [2022-11-18 20:26:56,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2096 states and 3347 transitions. [2022-11-18 20:26:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:26:56,010 INFO L428 stractBuchiCegarLoop]: Abstraction has 2096 states and 3347 transitions. [2022-11-18 20:26:56,010 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-11-18 20:26:56,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2096 states and 3347 transitions. [2022-11-18 20:26:56,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 196 [2022-11-18 20:26:56,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:56,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:56,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 15, 9, 9, 9, 9, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:56,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:56,021 INFO L748 eck$LassoCheckResult]: Stem: 91130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 91096#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; 91097#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 91129#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; 91156#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 91412#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91408#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; 91400#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91401#factENTRY ~n := #in~n; 91411#L25 assume ~n <= 0;#res := 1; 91407#factFINAL assume true; 91399#factEXIT >#68#return; 91397#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91398#factENTRY ~n := #in~n; 91406#L25 assume ~n <= 0;#res := 1; 91405#factFINAL assume true; 91396#factEXIT >#70#return; 91392#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91393#factENTRY ~n := #in~n; 91402#L25 assume ~n <= 0;#res := 1; 91395#factFINAL assume true; 91391#factEXIT >#72#return; 91389#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; 91385#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 91384#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 91382#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91383#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; 91271#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91481#factENTRY ~n := #in~n; 91476#L25 assume !(~n <= 0); 91450#L26 call #t~ret0 := fact(~n - 1);< 91454#factENTRY ~n := #in~n; 91477#L25 assume ~n <= 0;#res := 1; 91478#factFINAL assume true; 91449#factEXIT >#66#return; 91452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91270#factFINAL assume true; 91272#factEXIT >#74#return; 91197#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91200#factENTRY ~n := #in~n; 91506#L25 assume ~n <= 0;#res := 1; 91505#factFINAL assume true; 91196#factEXIT >#76#return; 91198#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91219#factENTRY ~n := #in~n; 91220#L25 assume !(~n <= 0); 91216#L26 call #t~ret0 := fact(~n - 1);< 91217#factENTRY ~n := #in~n; 91522#L25 assume ~n <= 0;#res := 1; 91519#factFINAL assume true; 91515#factEXIT >#66#return; 91514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91512#factFINAL assume true; 91511#factEXIT >#78#return; 91192#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; 91191#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 91190#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 91189#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 91128#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 91117#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 91119#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92011#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; 92000#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92001#factENTRY ~n := #in~n; 92012#L25 assume ~n <= 0;#res := 1; 92013#factFINAL assume true; 92062#factEXIT >#68#return; 92024#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92025#factENTRY ~n := #in~n; 92031#L25 assume ~n <= 0;#res := 1; 92029#factFINAL assume true; 92023#factEXIT >#70#return; 91933#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91885#factENTRY ~n := #in~n; 92018#L25 assume ~n <= 0;#res := 1; 92019#factFINAL assume true; 92799#factEXIT >#72#return; 92797#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; 92796#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92696#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92695#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92597#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; 91887#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91895#factENTRY ~n := #in~n; 91935#L25 assume !(~n <= 0); 91903#L26 call #t~ret0 := fact(~n - 1);< 91912#factENTRY ~n := #in~n; 91920#L25 assume ~n <= 0;#res := 1; 91915#factFINAL assume true; 91902#factEXIT >#66#return; 91898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91896#factFINAL assume true; 91886#factEXIT >#68#return; 91070#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91864#factENTRY ~n := #in~n; 91865#L25 assume !(~n <= 0); 91584#L26 call #t~ret0 := fact(~n - 1);< 91624#factENTRY ~n := #in~n; 91610#L25 assume ~n <= 0;#res := 1; 91607#factFINAL assume true; 91581#factEXIT >#66#return; 91135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91069#factFINAL assume true; 91071#factEXIT >#70#return; 91882#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91883#factENTRY ~n := #in~n; 92354#L25 assume ~n <= 0;#res := 1; 92353#factFINAL assume true; 91881#factEXIT >#72#return; 91877#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; 91875#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 91630#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 91626#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 91598#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; 91575#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91576#factENTRY ~n := #in~n; 91663#L25 assume !(~n <= 0); 91616#L26 call #t~ret0 := fact(~n - 1);< 91625#factENTRY ~n := #in~n; 91646#L25 assume !(~n <= 0); 91615#L26 call #t~ret0 := fact(~n - 1);< 91640#factENTRY ~n := #in~n; 91651#L25 assume ~n <= 0;#res := 1; 91668#factFINAL assume true; 91665#factEXIT >#66#return; 91664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91636#factFINAL assume true; 91612#factEXIT >#66#return; 91611#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91597#factFINAL assume true; 91574#factEXIT >#74#return; 91185#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91570#factENTRY ~n := #in~n; 91662#L25 assume !(~n <= 0); 91589#L26 call #t~ret0 := fact(~n - 1);< 91624#factENTRY ~n := #in~n; 91646#L25 assume !(~n <= 0); 91615#L26 call #t~ret0 := fact(~n - 1);< 91640#factENTRY ~n := #in~n; 91651#L25 assume ~n <= 0;#res := 1; 91668#factFINAL assume true; 91665#factEXIT >#66#return; 91664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91636#factFINAL assume true; 91612#factEXIT >#66#return; 91611#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91597#factFINAL assume true; 91574#factEXIT >#76#return; 91186#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91188#factENTRY ~n := #in~n; 91728#L25 assume !(~n <= 0); 91583#L26 call #t~ret0 := fact(~n - 1);< 91596#factENTRY ~n := #in~n; 91610#L25 assume ~n <= 0;#res := 1; 91607#factFINAL assume true; 91581#factEXIT >#66#return; 91573#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 91569#factFINAL assume true; 91179#factEXIT >#78#return; 91187#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; 91112#L30-9 [2022-11-18 20:26:56,021 INFO L750 eck$LassoCheckResult]: Loop: 91112#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 91113#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92469#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92467#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; 91560#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 91038#factENTRY ~n := #in~n; 92470#L25 assume !(~n <= 0); 92136#L26 call #t~ret0 := fact(~n - 1);< 92143#factENTRY ~n := #in~n; 92142#L25 assume !(~n <= 0); 92137#L26 call #t~ret0 := fact(~n - 1);< 92141#factENTRY ~n := #in~n; 92142#L25 assume !(~n <= 0); 92137#L26 call #t~ret0 := fact(~n - 1);< 92141#factENTRY ~n := #in~n; 92144#L25 assume ~n <= 0;#res := 1; 92155#factFINAL assume true; 92152#factEXIT >#66#return; 92149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92133#factFINAL assume true; 92139#factEXIT >#66#return; 92162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92459#factFINAL assume true; 92455#factEXIT >#66#return; 92456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92465#factFINAL assume true; 92463#factEXIT >#74#return; 91554#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 91152#factENTRY ~n := #in~n; 92474#L25 assume ~n <= 0;#res := 1; 92473#factFINAL assume true; 92472#factEXIT >#76#return; 91553#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 91038#factENTRY ~n := #in~n; 92470#L25 assume !(~n <= 0); 92136#L26 call #t~ret0 := fact(~n - 1);< 92143#factENTRY ~n := #in~n; 92142#L25 assume !(~n <= 0); 92137#L26 call #t~ret0 := fact(~n - 1);< 92141#factENTRY ~n := #in~n; 92144#L25 assume ~n <= 0;#res := 1; 92155#factFINAL assume true; 92152#factEXIT >#66#return; 92149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92133#factFINAL assume true; 92139#factEXIT >#66#return; 92159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92598#factFINAL assume true; 92176#factEXIT >#78#return; 91178#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; 91112#L30-9 [2022-11-18 20:26:56,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1332174790, now seen corresponding path program 10 times [2022-11-18 20:26:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:56,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139962701] [2022-11-18 20:26:56,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:56,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:56,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847200642] [2022-11-18 20:26:56,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:26:56,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:56,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:56,032 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:56,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2022-11-18 20:26:56,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:26:56,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:56,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:26:56,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 630 proven. 1 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-11-18 20:26:56,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 62 proven. 46 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2022-11-18 20:26:56,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139962701] [2022-11-18 20:26:56,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847200642] [2022-11-18 20:26:56,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847200642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:56,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:56,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-18 20:26:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598397402] [2022-11-18 20:26:56,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:56,427 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1595042406, now seen corresponding path program 7 times [2022-11-18 20:26:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:56,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175082841] [2022-11-18 20:26:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:56,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:56,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855399131] [2022-11-18 20:26:56,432 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:26:56,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:56,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:56,452 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:56,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2022-11-18 20:26:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:26:56,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:26:56,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 64 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-18 20:26:56,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 74 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-18 20:26:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:57,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175082841] [2022-11-18 20:26:57,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:57,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855399131] [2022-11-18 20:26:57,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855399131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:57,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:57,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2022-11-18 20:26:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209303020] [2022-11-18 20:26:57,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:57,231 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:26:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:26:57,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:26:57,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:26:57,232 INFO L87 Difference]: Start difference. First operand 2096 states and 3347 transitions. cyclomatic complexity: 1283 Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 9 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-18 20:26:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:57,805 INFO L93 Difference]: Finished difference Result 2721 states and 4174 transitions. [2022-11-18 20:26:57,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2721 states and 4174 transitions. [2022-11-18 20:26:57,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 296 [2022-11-18 20:26:57,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2721 states to 2711 states and 4164 transitions. [2022-11-18 20:26:57,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 678 [2022-11-18 20:26:57,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 678 [2022-11-18 20:26:57,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2711 states and 4164 transitions. [2022-11-18 20:26:57,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:26:57,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2711 states and 4164 transitions. [2022-11-18 20:26:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states and 4164 transitions. [2022-11-18 20:26:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2199. [2022-11-18 20:26:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1336 states have (on average 1.0748502994011977) internal successors, (1436), 1325 states have internal predecessors, (1436), 550 states have call successors, (574), 287 states have call predecessors, (574), 313 states have return successors, (1561), 586 states have call predecessors, (1561), 550 states have call successors, (1561) [2022-11-18 20:26:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3571 transitions. [2022-11-18 20:26:57,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2199 states and 3571 transitions. [2022-11-18 20:26:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:26:57,910 INFO L428 stractBuchiCegarLoop]: Abstraction has 2199 states and 3571 transitions. [2022-11-18 20:26:57,910 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-11-18 20:26:57,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2199 states and 3571 transitions. [2022-11-18 20:26:57,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2022-11-18 20:26:57,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:26:57,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:26:57,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 15, 9, 9, 9, 9, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:57,920 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-18 20:26:57,921 INFO L748 eck$LassoCheckResult]: Stem: 97209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 97182#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; 97183#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 97208#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; 97233#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 97473#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97470#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; 97468#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97469#factENTRY ~n := #in~n; 97474#L25 assume ~n <= 0;#res := 1; 97472#factFINAL assume true; 97467#factEXIT >#68#return; 97463#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97464#factENTRY ~n := #in~n; 97471#L25 assume ~n <= 0;#res := 1; 97466#factFINAL assume true; 97462#factEXIT >#70#return; 97458#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97459#factENTRY ~n := #in~n; 97465#L25 assume ~n <= 0;#res := 1; 97461#factFINAL assume true; 97457#factEXIT >#72#return; 97455#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; 97453#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97452#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97450#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97311#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; 97296#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97305#factENTRY ~n := #in~n; 97306#L25 assume !(~n <= 0); 97295#L26 call #t~ret0 := fact(~n - 1);< 97297#factENTRY ~n := #in~n; 97601#L25 assume ~n <= 0;#res := 1; 97600#factFINAL assume true; 97361#factEXIT >#66#return; 97362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97351#factFINAL assume true; 97352#factEXIT >#74#return; 97313#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97315#factENTRY ~n := #in~n; 97385#L25 assume ~n <= 0;#res := 1; 97379#factFINAL assume true; 97380#factEXIT >#76#return; 97252#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97531#factENTRY ~n := #in~n; 97532#L25 assume !(~n <= 0); 97528#L26 call #t~ret0 := fact(~n - 1);< 97529#factENTRY ~n := #in~n; 97619#L25 assume ~n <= 0;#res := 1; 97618#factFINAL assume true; 97617#factEXIT >#66#return; 97616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97615#factFINAL assume true; 97251#factEXIT >#78#return; 97253#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; 99047#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 99045#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99040#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 99033#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 99029#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 99027#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99025#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; 98555#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 98556#factENTRY ~n := #in~n; 98565#L25 assume ~n <= 0;#res := 1; 98562#factFINAL assume true; 98553#factEXIT >#68#return; 98548#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 98549#factENTRY ~n := #in~n; 98557#L25 assume ~n <= 0;#res := 1; 98550#factFINAL assume true; 98547#factEXIT >#70#return; 98511#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 98525#factENTRY ~n := #in~n; 98522#L25 assume ~n <= 0;#res := 1; 98523#factFINAL assume true; 99119#factEXIT >#72#return; 97201#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; 97202#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97205#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99100#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97634#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; 97635#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 98212#factENTRY ~n := #in~n; 99069#L25 assume !(~n <= 0); 98499#L26 call #t~ret0 := fact(~n - 1);< 98508#factENTRY ~n := #in~n; 98514#L25 assume ~n <= 0;#res := 1; 98510#factFINAL assume true; 98498#factEXIT >#66#return; 98481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98201#factFINAL assume true; 98207#factEXIT >#68#return; 98512#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 98527#factENTRY ~n := #in~n; 99129#L25 assume !(~n <= 0); 98755#L26 call #t~ret0 := fact(~n - 1);< 98804#factENTRY ~n := #in~n; 98768#L25 assume ~n <= 0;#res := 1; 98766#factFINAL assume true; 98749#factEXIT >#66#return; 98764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99299#factFINAL assume true; 99098#factEXIT >#70#return; 99095#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99096#factENTRY ~n := #in~n; 99099#L25 assume ~n <= 0;#res := 1; 99097#factFINAL assume true; 99094#factEXIT >#72#return; 99092#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; 99091#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 99090#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99087#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99084#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; 98842#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99083#factENTRY ~n := #in~n; 99103#L25 assume !(~n <= 0); 98792#L26 call #t~ret0 := fact(~n - 1);< 98835#factENTRY ~n := #in~n; 98933#L25 assume !(~n <= 0); 98791#L26 call #t~ret0 := fact(~n - 1);< 98839#factENTRY ~n := #in~n; 98941#L25 assume ~n <= 0;#res := 1; 98844#factFINAL assume true; 98837#factEXIT >#66#return; 98836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98818#factFINAL assume true; 98790#factEXIT >#66#return; 98800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99123#factFINAL assume true; 98944#factEXIT >#74#return; 98947#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 98950#factENTRY ~n := #in~n; 99093#L25 assume !(~n <= 0); 98757#L26 call #t~ret0 := fact(~n - 1);< 98804#factENTRY ~n := #in~n; 98933#L25 assume !(~n <= 0); 98791#L26 call #t~ret0 := fact(~n - 1);< 98839#factENTRY ~n := #in~n; 98941#L25 assume ~n <= 0;#res := 1; 98844#factFINAL assume true; 98837#factEXIT >#66#return; 98836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98818#factFINAL assume true; 98790#factEXIT >#66#return; 98800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99123#factFINAL assume true; 98944#factEXIT >#76#return; 98767#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99124#factENTRY ~n := #in~n; 99118#L25 assume !(~n <= 0); 98756#L26 call #t~ret0 := fact(~n - 1);< 98765#factENTRY ~n := #in~n; 98768#L25 assume ~n <= 0;#res := 1; 98766#factFINAL assume true; 98749#factEXIT >#66#return; 98762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99127#factFINAL assume true; 99125#factEXIT >#78#return; 99126#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; 97185#L30-9 [2022-11-18 20:26:57,921 INFO L750 eck$LassoCheckResult]: Loop: 97185#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 97191#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97215#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97216#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; 99271#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97153#factENTRY ~n := #in~n; 99280#L25 assume !(~n <= 0); 99075#L26 call #t~ret0 := fact(~n - 1);< 99148#factENTRY ~n := #in~n; 97181#L25 assume !(~n <= 0); 99070#L26 call #t~ret0 := fact(~n - 1);< 99182#factENTRY ~n := #in~n; 97181#L25 assume !(~n <= 0); 99070#L26 call #t~ret0 := fact(~n - 1);< 99182#factENTRY ~n := #in~n; 99186#L25 assume ~n <= 0;#res := 1; 99183#factFINAL assume true; 99179#factEXIT >#66#return; 99178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99175#factFINAL assume true; 99162#factEXIT >#66#return; 99172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99202#factFINAL assume true; 99198#factEXIT >#66#return; 99199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99276#factFINAL assume true; 99270#factEXIT >#74#return; 99265#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97229#factENTRY ~n := #in~n; 99287#L25 assume !(~n <= 0); 99071#L26 call #t~ret0 := fact(~n - 1);< 99176#factENTRY ~n := #in~n; 97181#L25 assume !(~n <= 0); 99070#L26 call #t~ret0 := fact(~n - 1);< 99182#factENTRY ~n := #in~n; 99186#L25 assume ~n <= 0;#res := 1; 99183#factFINAL assume true; 99179#factEXIT >#66#return; 99178#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99175#factFINAL assume true; 99162#factEXIT >#66#return; 99167#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99284#factFINAL assume true; 99278#factEXIT >#76#return; 99191#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99193#factENTRY ~n := #in~n; 99190#L25 assume !(~n <= 0); 99164#L26 call #t~ret0 := fact(~n - 1);< 99256#factENTRY ~n := #in~n; 99257#L25 assume ~n <= 0;#res := 1; 99255#factFINAL assume true; 99250#factEXIT >#66#return; 99251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99274#factFINAL assume true; 99261#factEXIT >#78#return; 97184#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; 97185#L30-9 [2022-11-18 20:26:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1332174790, now seen corresponding path program 11 times [2022-11-18 20:26:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:57,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127962626] [2022-11-18 20:26:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:57,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:57,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311013406] [2022-11-18 20:26:57,930 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:26:57,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:57,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:57,937 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:57,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2022-11-18 20:26:58,100 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-18 20:26:58,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:58,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:26:58,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2022-11-18 20:26:58,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:26:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:26:58,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127962626] [2022-11-18 20:26:58,161 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:26:58,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311013406] [2022-11-18 20:26:58,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311013406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:26:58,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:26:58,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:26:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270215377] [2022-11-18 20:26:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:26:58,162 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:26:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash 769904862, now seen corresponding path program 8 times [2022-11-18 20:26:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:26:58,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925841603] [2022-11-18 20:26:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:26:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:26:58,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:26:58,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083233600] [2022-11-18 20:26:58,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:26:58,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:26:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:26:58,171 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:26:58,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2022-11-18 20:26:58,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:26:58,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:26:58,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:26:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:26:58,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:27:11,427 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 4 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:27:11,678 INFO L210 LassoAnalysis]: Preferences: [2022-11-18 20:27:11,679 INFO L126 ssoRankerPreferences]: Compute integeral hull: false WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-11-18 20:34:36,809 INFO L750 eck$LassoCheckResult]: Loop: 742497#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 742575#factENTRY ~n := #in~n; 744140#L25 assume !(~n <= 0); 742127#L26 call #t~ret0 := fact(~n - 1);< 742663#factENTRY ~n := #in~n; 743405#L25 assume !(~n <= 0); 742123#L26 call #t~ret0 := fact(~n - 1);< 742140#factENTRY ~n := #in~n; 744110#L25 assume !(~n <= 0); 742132#L26 call #t~ret0 := fact(~n - 1);< 742452#factENTRY ~n := #in~n; 742598#L25 assume !(~n <= 0); 742428#L26 call #t~ret0 := fact(~n - 1);< 742534#factENTRY ~n := #in~n; 742604#L25 assume !(~n <= 0); 741800#L26 call #t~ret0 := fact(~n - 1);< 741819#factENTRY ~n := #in~n; 742599#L25 assume !(~n <= 0); 741788#L26 call #t~ret0 := fact(~n - 1);< 742535#factENTRY ~n := #in~n; 743004#L25 assume !(~n <= 0); 741794#L26 call #t~ret0 := fact(~n - 1);< 742803#factENTRY ~n := #in~n; 744142#L25 assume !(~n <= 0); 741844#L26 call #t~ret0 := fact(~n - 1);< 741896#factENTRY ~n := #in~n; 741933#L25 assume ~n <= 0;#res := 1; 741911#factFINAL assume true; 741894#factEXIT >#66#return; 741889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741880#factFINAL assume true; 741841#factEXIT >#66#return; 741846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 745541#factFINAL assume true; 741778#factEXIT >#66#return; 741812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742579#factFINAL assume true; 742526#factEXIT >#66#return; 742469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742455#factFINAL assume true; 742445#factEXIT >#66#return; 742443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742435#factFINAL assume true; 742425#factEXIT >#66#return; 742430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743678#factFINAL assume true; 742122#factEXIT >#66#return; 742136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743394#factFINAL assume true; 742966#factEXIT >#66#return; 742969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 744156#factFINAL assume true; 742542#factEXIT >#78#return; 740267#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; 740066#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 740067#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 745806#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 740077#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 740069#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 740070#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 745785#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; 740046#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 740047#factENTRY ~n := #in~n; 741111#L25 assume !(~n <= 0); 741074#L26 call #t~ret0 := fact(~n - 1);< 741076#factENTRY ~n := #in~n; 740261#L25 assume !(~n <= 0); 741072#L26 call #t~ret0 := fact(~n - 1);< 741082#factENTRY ~n := #in~n; 740261#L25 assume !(~n <= 0); 741072#L26 call #t~ret0 := fact(~n - 1);< 741082#factENTRY ~n := #in~n; 740261#L25 assume !(~n <= 0); 741072#L26 call #t~ret0 := fact(~n - 1);< 741082#factENTRY ~n := #in~n; 740261#L25 assume !(~n <= 0); 741072#L26 call #t~ret0 := fact(~n - 1);< 741082#factENTRY ~n := #in~n; 740261#L25 assume !(~n <= 0); 741072#L26 call #t~ret0 := fact(~n - 1);< 741082#factENTRY ~n := #in~n; 740261#L25 assume !(~n <= 0); 741072#L26 call #t~ret0 := fact(~n - 1);< 741082#factENTRY ~n := #in~n; 741094#L25 assume ~n <= 0;#res := 1; 741098#factFINAL assume true; 741093#factEXIT >#66#return; 741087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741081#factFINAL assume true; 741071#factEXIT >#66#return; 741075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741594#factFINAL assume true; 741592#factEXIT >#66#return; 741593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741665#factFINAL assume true; 741652#factEXIT >#66#return; 741653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741666#factFINAL assume true; 741660#factEXIT >#66#return; 741657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741651#factFINAL assume true; 741650#factEXIT >#66#return; 741648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741643#factFINAL assume true; 741638#factEXIT >#66#return; 741631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741640#factFINAL assume true; 741634#factEXIT >#68#return; 740163#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 740229#factENTRY ~n := #in~n; 740242#L25 assume ~n <= 0;#res := 1; 740232#factFINAL assume true; 740124#factEXIT >#70#return; 740215#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 741339#factENTRY ~n := #in~n; 741333#L25 assume !(~n <= 0); 741303#L26 call #t~ret0 := fact(~n - 1);< 741311#factENTRY ~n := #in~n; 741306#L25 assume !(~n <= 0); 741239#L26 call #t~ret0 := fact(~n - 1);< 741301#factENTRY ~n := #in~n; 741291#L25 assume !(~n <= 0); 741198#L26 call #t~ret0 := fact(~n - 1);< 741217#factENTRY ~n := #in~n; 741199#L25 assume !(~n <= 0); 741178#L26 call #t~ret0 := fact(~n - 1);< 741196#factENTRY ~n := #in~n; 741194#L25 assume !(~n <= 0); 740992#L26 call #t~ret0 := fact(~n - 1);< 741175#factENTRY ~n := #in~n; 741173#L25 assume !(~n <= 0); 740953#L26 call #t~ret0 := fact(~n - 1);< 741167#factENTRY ~n := #in~n; 741163#L25 assume !(~n <= 0); 740960#L26 call #t~ret0 := fact(~n - 1);< 741160#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741297#factFINAL assume true; 741284#factEXIT >#66#return; 741283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741278#factFINAL assume true; 741269#factEXIT >#66#return; 741266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741259#factFINAL assume true; 741233#factEXIT >#66#return; 741246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741398#factFINAL assume true; 741393#factEXIT >#66#return; 741395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741677#factFINAL assume true; 741609#factEXIT >#72#return; 741581#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; 745810#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 745809#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 745808#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 745807#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; 740800#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 740870#factENTRY ~n := #in~n; 741142#L25 assume !(~n <= 0); 740975#L26 call #t~ret0 := fact(~n - 1);< 741125#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741297#factFINAL assume true; 741284#factEXIT >#66#return; 741283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741278#factFINAL assume true; 741269#factEXIT >#66#return; 741266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741259#factFINAL assume true; 741233#factEXIT >#66#return; 741246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741398#factFINAL assume true; 741393#factEXIT >#66#return; 741390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741386#factFINAL assume true; 741382#factEXIT >#66#return; 741381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741379#factFINAL assume true; 741370#factEXIT >#66#return; 741369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741367#factFINAL assume true; 741359#factEXIT >#66#return; 741358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741357#factFINAL assume true; 741353#factEXIT >#66#return; 741352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741351#factFINAL assume true; 741347#factEXIT >#66#return; 741348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741493#factFINAL assume true; 741488#factEXIT >#66#return; 741487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741485#factFINAL assume true; 741183#factEXIT >#68#return; 740363#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 740094#factENTRY ~n := #in~n; 741442#L25 assume !(~n <= 0); 740789#L26 call #t~ret0 := fact(~n - 1);< 741124#factENTRY ~n := #in~n; 740931#L25 assume ~n <= 0;#res := 1; 740928#factFINAL assume true; 740771#factEXIT >#66#return; 740688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740685#factFINAL assume true; 740351#factEXIT >#70#return; 740631#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 741545#factENTRY ~n := #in~n; 741436#L25 assume !(~n <= 0); 741114#L26 call #t~ret0 := fact(~n - 1);< 741119#factENTRY ~n := #in~n; 741116#L25 assume !(~n <= 0); 741096#L26 call #t~ret0 := fact(~n - 1);< 741110#factENTRY ~n := #in~n; 741099#L25 assume !(~n <= 0); 741079#L26 call #t~ret0 := fact(~n - 1);< 741088#factENTRY ~n := #in~n; 741084#L25 assume !(~n <= 0); 741061#L26 call #t~ret0 := fact(~n - 1);< 741068#factENTRY ~n := #in~n; 741065#L25 assume !(~n <= 0); 741050#L26 call #t~ret0 := fact(~n - 1);< 741058#factENTRY ~n := #in~n; 741053#L25 assume !(~n <= 0); 741042#L26 call #t~ret0 := fact(~n - 1);< 741047#factENTRY ~n := #in~n; 741044#L25 assume !(~n <= 0); 741035#L26 call #t~ret0 := fact(~n - 1);< 741039#factENTRY ~n := #in~n; 741037#L25 assume !(~n <= 0); 741031#L26 call #t~ret0 := fact(~n - 1);< 741034#factENTRY ~n := #in~n; 741033#L25 assume !(~n <= 0); 741014#L26 call #t~ret0 := fact(~n - 1);< 741029#factENTRY ~n := #in~n; 741024#L25 assume !(~n <= 0); 740983#L26 call #t~ret0 := fact(~n - 1);< 741015#factENTRY ~n := #in~n; 741032#L25 assume !(~n <= 0); 740967#L26 call #t~ret0 := fact(~n - 1);< 740984#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741297#factFINAL assume true; 741284#factEXIT >#66#return; 741283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741278#factFINAL assume true; 741269#factEXIT >#66#return; 741266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741259#factFINAL assume true; 741233#factEXIT >#66#return; 741246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741398#factFINAL assume true; 741393#factEXIT >#66#return; 741390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741386#factFINAL assume true; 741382#factEXIT >#66#return; 741381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741379#factFINAL assume true; 741370#factEXIT >#66#return; 741369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741367#factFINAL assume true; 741359#factEXIT >#66#return; 741358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741357#factFINAL assume true; 741353#factEXIT >#66#return; 741352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741351#factFINAL assume true; 741347#factEXIT >#66#return; 741348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741493#factFINAL assume true; 741488#factEXIT >#66#return; 741489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741562#factFINAL assume true; 741530#factEXIT >#72#return; 741515#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; 745791#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 745788#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 745787#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 745786#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; 740806#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 740870#factENTRY ~n := #in~n; 741142#L25 assume !(~n <= 0); 740975#L26 call #t~ret0 := fact(~n - 1);< 741125#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740944#factFINAL assume true; 740796#factEXIT >#68#return; 740418#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 740094#factENTRY ~n := #in~n; 741442#L25 assume !(~n <= 0); 740789#L26 call #t~ret0 := fact(~n - 1);< 741124#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740793#factFINAL assume true; 740689#factEXIT >#70#return; 740727#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 741164#factENTRY ~n := #in~n; 741162#L25 assume !(~n <= 0); 740787#L26 call #t~ret0 := fact(~n - 1);< 740792#factENTRY ~n := #in~n; 740931#L25 assume ~n <= 0;#res := 1; 740928#factFINAL assume true; 740771#factEXIT >#66#return; 740790#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740941#factFINAL assume true; 740933#factEXIT >#72#return; 740937#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; 745813#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 745803#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 745769#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 744502#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; 740814#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 740870#factENTRY ~n := #in~n; 741142#L25 assume !(~n <= 0); 740975#L26 call #t~ret0 := fact(~n - 1);< 741125#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740944#factFINAL assume true; 740796#factEXIT >#68#return; 740530#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 740945#factENTRY ~n := #in~n; 741437#L25 assume !(~n <= 0); 740786#L26 call #t~ret0 := fact(~n - 1);< 741003#factENTRY ~n := #in~n; 741028#L25 assume !(~n <= 0); 740968#L26 call #t~ret0 := fact(~n - 1);< 741022#factENTRY ~n := #in~n; 741478#L25 assume !(~n <= 0); 741019#L26 call #t~ret0 := fact(~n - 1);< 741021#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740944#factFINAL assume true; 740796#factEXIT >#70#return; 740841#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 740912#factENTRY ~n := #in~n; 740922#L25 assume ~n <= 0;#res := 1; 740917#factFINAL assume true; 740884#factEXIT >#72#return; 740909#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; 742366#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 742365#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 742364#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 742363#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; 741126#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 741143#factENTRY ~n := #in~n; 741139#L25 assume !(~n <= 0); 740963#L26 call #t~ret0 := fact(~n - 1);< 741125#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741030#L25 assume !(~n <= 0); 740959#L26 call #t~ret0 := fact(~n - 1);< 741023#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741297#factFINAL assume true; 741284#factEXIT >#66#return; 741287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741337#factFINAL assume true; 741335#factEXIT >#74#return; 740824#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 740946#factENTRY ~n := #in~n; 741302#L25 assume !(~n <= 0); 740998#L26 call #t~ret0 := fact(~n - 1);< 741002#factENTRY ~n := #in~n; 741440#L25 assume !(~n <= 0); 740954#L26 call #t~ret0 := fact(~n - 1);< 740980#factENTRY ~n := #in~n; 741478#L25 assume !(~n <= 0); 741019#L26 call #t~ret0 := fact(~n - 1);< 741021#factENTRY ~n := #in~n; 741027#L25 assume ~n <= 0;#res := 1; 741026#factFINAL assume true; 741018#factEXIT >#66#return; 741004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740982#factFINAL assume true; 740947#factEXIT >#66#return; 740978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741005#factFINAL assume true; 740985#factEXIT >#66#return; 740981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740944#factFINAL assume true; 740796#factEXIT >#76#return; 740600#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 740687#factENTRY ~n := #in~n; 741479#L25 assume !(~n <= 0); 740781#L26 call #t~ret0 := fact(~n - 1);< 740792#factENTRY ~n := #in~n; 740931#L25 assume ~n <= 0;#res := 1; 740928#factFINAL assume true; 740771#factEXIT >#66#return; 740688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 740685#factFINAL assume true; 740351#factEXIT >#78#return; 740683#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; 742362#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 744053#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 744052#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 744051#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; 742855#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 742892#factENTRY ~n := #in~n; 743707#L25 assume !(~n <= 0); 742756#L26 call #t~ret0 := fact(~n - 1);< 743215#factENTRY ~n := #in~n; 743642#L25 assume !(~n <= 0); 742753#L26 call #t~ret0 := fact(~n - 1);< 743641#factENTRY ~n := #in~n; 743642#L25 assume !(~n <= 0); 742753#L26 call #t~ret0 := fact(~n - 1);< 743641#factENTRY ~n := #in~n; 743642#L25 assume !(~n <= 0); 742753#L26 call #t~ret0 := fact(~n - 1);< 743641#factENTRY ~n := #in~n; 743642#L25 assume !(~n <= 0); 742753#L26 call #t~ret0 := fact(~n - 1);< 743641#factENTRY ~n := #in~n; 743642#L25 assume !(~n <= 0); 742753#L26 call #t~ret0 := fact(~n - 1);< 743641#factENTRY ~n := #in~n; 743680#L25 assume ~n <= 0;#res := 1; 743158#factFINAL assume true; 742905#factEXIT >#66#return; 742904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742895#factFINAL assume true; 742745#factEXIT >#66#return; 742774#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 744034#factFINAL assume true; 744018#factEXIT >#66#return; 744017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743302#factFINAL assume true; 743253#factEXIT >#66#return; 743267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743723#factFINAL assume true; 743709#factEXIT >#66#return; 743708#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743702#factFINAL assume true; 743683#factEXIT >#66#return; 743686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743156#factFINAL assume true; 742881#factEXIT >#74#return; 742890#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 743102#factENTRY ~n := #in~n; 743982#L25 assume !(~n <= 0); 743381#L26 call #t~ret0 := fact(~n - 1);< 743393#factENTRY ~n := #in~n; 745549#L25 assume !(~n <= 0); 743133#L26 call #t~ret0 := fact(~n - 1);< 743408#factENTRY ~n := #in~n; 743913#L25 assume !(~n <= 0); 744061#L26 call #t~ret0 := fact(~n - 1);< 744066#factENTRY ~n := #in~n; 743530#L25 assume ~n <= 0;#res := 1; 744085#factFINAL assume true; 744060#factEXIT >#66#return; 744059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 744057#factFINAL assume true; 743113#factEXIT >#66#return; 743143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743401#factFINAL assume true; 743378#factEXIT >#66#return; 743389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743980#factFINAL assume true; 743099#factEXIT >#76#return; 742616#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 742806#factENTRY ~n := #in~n; 743536#L25 assume !(~n <= 0); 743115#L26 call #t~ret0 := fact(~n - 1);< 743534#factENTRY ~n := #in~n; 744071#L25 assume !(~n <= 0); 743130#L26 call #t~ret0 := fact(~n - 1);< 744063#factENTRY ~n := #in~n; 743530#L25 assume ~n <= 0;#res := 1; 744085#factFINAL assume true; 744060#factEXIT >#66#return; 744059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 744057#factFINAL assume true; 743113#factEXIT >#66#return; 743144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743532#factFINAL assume true; 743019#factEXIT >#78#return; 742613#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; 742612#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 742611#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 742609#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 742607#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; 742511#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 742524#factENTRY ~n := #in~n; 744788#L25 assume !(~n <= 0); 741804#L26 call #t~ret0 := fact(~n - 1);< 743000#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741912#L25 assume !(~n <= 0); 741782#L26 call #t~ret0 := fact(~n - 1);< 741897#factENTRY ~n := #in~n; 741933#L25 assume ~n <= 0;#res := 1; 741911#factFINAL assume true; 741894#factEXIT >#66#return; 741889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741880#factFINAL assume true; 741841#factEXIT >#66#return; 741846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 745541#factFINAL assume true; 741778#factEXIT >#66#return; 741812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742579#factFINAL assume true; 742526#factEXIT >#66#return; 742469#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742455#factFINAL assume true; 742445#factEXIT >#66#return; 742443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742435#factFINAL assume true; 742425#factEXIT >#66#return; 742430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743678#factFINAL assume true; 742122#factEXIT >#66#return; 742136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743394#factFINAL assume true; 742966#factEXIT >#66#return; 742817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742667#factFINAL assume true; 742657#factEXIT >#66#return; 742662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 743513#factFINAL assume true; 743509#factEXIT >#66#return; 743510#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 744782#factFINAL assume true; 742785#factEXIT >#74#return; 742583#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 742594#factENTRY ~n := #in~n; 742960#L25 assume !(~n <= 0); 741784#L26 call #t~ret0 := fact(~n - 1);< 740064#factENTRY ~n := #in~n; 745550#L25 assume !(~n <= 0); 741843#L26 call #t~ret0 := fact(~n - 1);< 741882#factENTRY ~n := #in~n; 741892#L25 assume !(~n <= 0); 741895#L26 call #t~ret0 := fact(~n - 1);< 741898#factENTRY ~n := #in~n; 741933#L25 assume ~n <= 0;#res := 1; 741911#factFINAL assume true; 741894#factEXIT >#66#return; 741889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 741880#factFINAL assume true; 741841#factEXIT >#66#return; 741846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 745541#factFINAL assume true; 741778#factEXIT >#66#return; 741815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 742593#factFINAL assume true; 742581#factEXIT >#76#return; 742497#L30-7 [2022-11-18 20:34:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash 586954980, now seen corresponding path program 53 times [2022-11-18 20:34:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:36,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632642509] [2022-11-18 20:34:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:36,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:34:36,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581574539] [2022-11-18 20:34:36,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:34:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:36,853 INFO L229 MonitoredProcess]: Starting monitored process 317 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:36,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (317)] Waiting until timeout for monitored process [2022-11-18 20:34:40,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2022-11-18 20:34:40,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:34:40,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 1739 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:34:40,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38317 backedges. 11287 proven. 128 refuted. 0 times theorem prover too weak. 26902 trivial. 0 not checked. [2022-11-18 20:34:40,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:34:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 38317 backedges. 3407 proven. 645 refuted. 0 times theorem prover too weak. 34265 trivial. 0 not checked. [2022-11-18 20:34:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:42,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632642509] [2022-11-18 20:34:42,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:34:42,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581574539] [2022-11-18 20:34:42,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581574539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:34:42,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:34:42,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2022-11-18 20:34:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93823933] [2022-11-18 20:34:42,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:34:42,745 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:34:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:42,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1801478201, now seen corresponding path program 37 times [2022-11-18 20:34:42,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:42,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554696934] [2022-11-18 20:34:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:42,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:42,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:34:42,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370410362] [2022-11-18 20:34:42,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:34:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:42,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:42,790 INFO L229 MonitoredProcess]: Starting monitored process 318 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:42,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (318)] Waiting until timeout for monitored process [2022-11-18 20:34:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:44,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1481 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 20:34:44,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 34435 backedges. 17181 proven. 1005 refuted. 0 times theorem prover too weak. 16249 trivial. 0 not checked. [2022-11-18 20:34:45,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:34:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34435 backedges. 1281 proven. 6395 refuted. 0 times theorem prover too weak. 26759 trivial. 0 not checked. [2022-11-18 20:34:52,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:52,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554696934] [2022-11-18 20:34:52,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:34:52,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370410362] [2022-11-18 20:34:52,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370410362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:34:52,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:34:52,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 40 [2022-11-18 20:34:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337413787] [2022-11-18 20:34:52,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:34:52,626 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:34:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 20:34:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-11-18 20:34:52,627 INFO L87 Difference]: Start difference. First operand 6971 states and 15100 transitions. cyclomatic complexity: 8181 Second operand has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 40 states have internal predecessors, (101), 23 states have call successors, (37), 2 states have call predecessors, (37), 18 states have return successors, (49), 18 states have call predecessors, (49), 23 states have call successors, (49) [2022-11-18 20:34:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:56,843 INFO L93 Difference]: Finished difference Result 8078 states and 17892 transitions. [2022-11-18 20:34:56,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8078 states and 17892 transitions. [2022-11-18 20:34:57,106 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1439 [2022-11-18 20:34:57,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8078 states to 8077 states and 17890 transitions. [2022-11-18 20:34:57,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2491 [2022-11-18 20:34:57,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2509 [2022-11-18 20:34:57,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8077 states and 17890 transitions. [2022-11-18 20:34:57,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:34:57,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8077 states and 17890 transitions. [2022-11-18 20:34:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8077 states and 17890 transitions. [2022-11-18 20:34:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8077 to 7079. [2022-11-18 20:34:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7079 states, 3980 states have (on average 1.0412060301507537) internal successors, (4144), 3957 states have internal predecessors, (4144), 2322 states have call successors, (2416), 973 states have call predecessors, (2416), 777 states have return successors, (8787), 2148 states have call predecessors, (8787), 2322 states have call successors, (8787) [2022-11-18 20:34:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7079 states to 7079 states and 15347 transitions. [2022-11-18 20:34:57,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7079 states and 15347 transitions. [2022-11-18 20:34:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 20:34:57,511 INFO L428 stractBuchiCegarLoop]: Abstraction has 7079 states and 15347 transitions. [2022-11-18 20:34:57,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 70 ============ [2022-11-18 20:34:57,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7079 states and 15347 transitions. [2022-11-18 20:34:57,549 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1077 [2022-11-18 20:34:57,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:34:57,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:34:57,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [138, 138, 91, 91, 91, 91, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:34:57,554 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [101, 101, 80, 80, 80, 80, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:34:57,555 INFO L748 eck$LassoCheckResult]: Stem: 764223#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 764197#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; 764198#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 764222#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; 764247#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 764258#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 764256#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; 764254#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764255#factENTRY ~n := #in~n; 764263#L25 assume ~n <= 0;#res := 1; 764261#factFINAL assume true; 764253#factEXIT >#68#return; 764240#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764241#factENTRY ~n := #in~n; 764259#L25 assume ~n <= 0;#res := 1; 764257#factFINAL assume true; 764252#factEXIT >#70#return; 764159#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 764160#factENTRY ~n := #in~n; 764392#L25 assume ~n <= 0;#res := 1; 764271#factFINAL assume true; 764267#factEXIT >#72#return; 764217#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; 764218#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 764220#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 764932#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 764930#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; 764921#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764922#factENTRY ~n := #in~n; 764937#L25 assume !(~n <= 0); 764934#L26 call #t~ret0 := fact(~n - 1);< 764935#factENTRY ~n := #in~n; 764938#L25 assume ~n <= 0;#res := 1; 764936#factFINAL assume true; 764933#factEXIT >#66#return; 764931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764929#factFINAL assume true; 764920#factEXIT >#74#return; 764917#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764918#factENTRY ~n := #in~n; 764928#L25 assume ~n <= 0;#res := 1; 764927#factFINAL assume true; 764916#factEXIT >#76#return; 764901#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 764902#factENTRY ~n := #in~n; 764926#L25 assume !(~n <= 0); 764914#L26 call #t~ret0 := fact(~n - 1);< 764915#factENTRY ~n := #in~n; 764925#L25 assume ~n <= 0;#res := 1; 764924#factFINAL assume true; 764913#factEXIT >#66#return; 764911#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764909#factFINAL assume true; 764900#factEXIT >#78#return; 764898#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; 764897#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 764892#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 764888#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 764882#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; 764865#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764866#factENTRY ~n := #in~n; 764881#L25 assume !(~n <= 0); 764878#L26 call #t~ret0 := fact(~n - 1);< 764880#factENTRY ~n := #in~n; 764905#L25 assume !(~n <= 0); 764879#L26 call #t~ret0 := fact(~n - 1);< 764896#factENTRY ~n := #in~n; 764903#L25 assume ~n <= 0;#res := 1; 764899#factFINAL assume true; 764895#factEXIT >#66#return; 764891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764887#factFINAL assume true; 764877#factEXIT >#66#return; 764876#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764875#factFINAL assume true; 764864#factEXIT >#74#return; 764860#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764861#factENTRY ~n := #in~n; 764874#L25 assume ~n <= 0;#res := 1; 764863#factFINAL assume true; 764859#factEXIT >#76#return; 764856#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 764857#factENTRY ~n := #in~n; 764890#L25 assume !(~n <= 0); 764868#L26 call #t~ret0 := fact(~n - 1);< 764873#factENTRY ~n := #in~n; 764907#L25 assume !(~n <= 0); 764871#L26 call #t~ret0 := fact(~n - 1);< 764894#factENTRY ~n := #in~n; 764906#L25 assume ~n <= 0;#res := 1; 764904#factFINAL assume true; 764893#factEXIT >#66#return; 764889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764883#factFINAL assume true; 764867#factEXIT >#66#return; 764862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764858#factFINAL assume true; 764855#factEXIT >#78#return; 764854#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; 764853#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 764852#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 764851#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 764850#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; 764842#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764923#factENTRY ~n := #in~n; 764919#L25 assume !(~n <= 0); 764869#L26 call #t~ret0 := fact(~n - 1);< 764873#factENTRY ~n := #in~n; 764907#L25 assume !(~n <= 0); 764871#L26 call #t~ret0 := fact(~n - 1);< 764894#factENTRY ~n := #in~n; 764907#L25 assume !(~n <= 0); 764871#L26 call #t~ret0 := fact(~n - 1);< 764894#factENTRY ~n := #in~n; 764906#L25 assume ~n <= 0;#res := 1; 764904#factFINAL assume true; 764893#factEXIT >#66#return; 764889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764883#factFINAL assume true; 764867#factEXIT >#66#return; 764872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764946#factFINAL assume true; 764942#factEXIT >#66#return; 764941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764940#factFINAL assume true; 764841#factEXIT >#74#return; 764829#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764991#factENTRY ~n := #in~n; 764844#L25 assume ~n <= 0;#res := 1; 764845#factFINAL assume true; 764828#factEXIT >#76#return; 764830#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 765364#factENTRY ~n := #in~n; 765362#L25 assume !(~n <= 0); 764957#L26 call #t~ret0 := fact(~n - 1);< 765312#factENTRY ~n := #in~n; 765324#L25 assume !(~n <= 0); 764955#L26 call #t~ret0 := fact(~n - 1);< 764965#factENTRY ~n := #in~n; 765325#L25 assume !(~n <= 0); 764956#L26 call #t~ret0 := fact(~n - 1);< 765319#factENTRY ~n := #in~n; 765328#L25 assume ~n <= 0;#res := 1; 765327#factFINAL assume true; 765318#factEXIT >#66#return; 765317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 765316#factFINAL assume true; 765315#factEXIT >#66#return; 765314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 765313#factFINAL assume true; 765310#factEXIT >#66#return; 764964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 765451#factFINAL assume true; 765379#factEXIT >#78#return; 764671#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; 764667#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 764661#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 764634#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 764629#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; 764626#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764627#factENTRY ~n := #in~n; 764641#L25 assume !(~n <= 0); 764637#L26 call #t~ret0 := fact(~n - 1);< 764639#factENTRY ~n := #in~n; 764646#L25 assume !(~n <= 0); 764638#L26 call #t~ret0 := fact(~n - 1);< 764644#factENTRY ~n := #in~n; 764646#L25 assume !(~n <= 0); 764638#L26 call #t~ret0 := fact(~n - 1);< 764644#factENTRY ~n := #in~n; 764646#L25 assume !(~n <= 0); 764638#L26 call #t~ret0 := fact(~n - 1);< 764644#factENTRY ~n := #in~n; 764646#L25 assume !(~n <= 0); 764638#L26 call #t~ret0 := fact(~n - 1);< 764644#factENTRY ~n := #in~n; 764646#L25 assume !(~n <= 0); 764638#L26 call #t~ret0 := fact(~n - 1);< 764644#factENTRY ~n := #in~n; 764659#L25 assume ~n <= 0;#res := 1; 764658#factFINAL assume true; 764657#factEXIT >#66#return; 764656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764655#factFINAL assume true; 764654#factEXIT >#66#return; 764653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764652#factFINAL assume true; 764651#factEXIT >#66#return; 764650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764649#factFINAL assume true; 764648#factEXIT >#66#return; 764647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764645#factFINAL assume true; 764643#factEXIT >#66#return; 764642#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764640#factFINAL assume true; 764636#factEXIT >#66#return; 764631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764628#factFINAL assume true; 764625#factEXIT >#74#return; 764612#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764614#factENTRY ~n := #in~n; 764618#L25 assume ~n <= 0;#res := 1; 764616#factFINAL assume true; 764610#factEXIT >#76#return; 764574#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 764605#factENTRY ~n := #in~n; 764602#L25 assume !(~n <= 0); 764485#L26 call #t~ret0 := fact(~n - 1);< 764575#factENTRY ~n := #in~n; 764615#L25 assume !(~n <= 0); 764482#L26 call #t~ret0 := fact(~n - 1);< 764588#factENTRY ~n := #in~n; 764624#L25 assume !(~n <= 0); 764488#L26 call #t~ret0 := fact(~n - 1);< 764541#factENTRY ~n := #in~n; 764623#L25 assume !(~n <= 0); 764486#L26 call #t~ret0 := fact(~n - 1);< 764609#factENTRY ~n := #in~n; 764623#L25 assume !(~n <= 0); 764486#L26 call #t~ret0 := fact(~n - 1);< 764609#factENTRY ~n := #in~n; 764623#L25 assume !(~n <= 0); 764486#L26 call #t~ret0 := fact(~n - 1);< 764609#factENTRY ~n := #in~n; 764623#L25 assume !(~n <= 0); 764486#L26 call #t~ret0 := fact(~n - 1);< 764609#factENTRY ~n := #in~n; 764622#L25 assume ~n <= 0;#res := 1; 764621#factFINAL assume true; 764608#factEXIT >#66#return; 764607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764604#factFINAL assume true; 764599#factEXIT >#66#return; 764593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764591#factFINAL assume true; 764586#factEXIT >#66#return; 764585#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764584#factFINAL assume true; 764583#factEXIT >#66#return; 764582#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764581#factFINAL assume true; 764578#factEXIT >#66#return; 764576#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764573#factFINAL assume true; 764568#factEXIT >#66#return; 764509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764510#factFINAL assume true; 764495#factEXIT >#66#return; 764497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764710#factFINAL assume true; 764692#factEXIT >#78#return; 764424#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; 764423#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 764422#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 764421#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 764420#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 764419#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 764418#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 764406#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; 764396#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764397#factENTRY ~n := #in~n; 764415#L25 assume !(~n <= 0); 764412#L26 call #t~ret0 := fact(~n - 1);< 764413#factENTRY ~n := #in~n; 764416#L25 assume ~n <= 0;#res := 1; 764414#factFINAL assume true; 764411#factEXIT >#66#return; 764408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764405#factFINAL assume true; 764395#factEXIT >#68#return; 764317#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764391#factENTRY ~n := #in~n; 764404#L25 assume ~n <= 0;#res := 1; 764394#factFINAL assume true; 764273#factEXIT >#70#return; 764269#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 764270#factENTRY ~n := #in~n; 764403#L25 assume !(~n <= 0); 764400#L26 call #t~ret0 := fact(~n - 1);< 764402#factENTRY ~n := #in~n; 764409#L25 assume ~n <= 0;#res := 1; 764407#factFINAL assume true; 764398#factEXIT >#66#return; 764393#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 764272#factFINAL assume true; 764268#factEXIT >#72#return; 764266#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; 764265#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 764264#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 764262#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 764260#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; 764177#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764178#factENTRY ~n := #in~n; 764410#L25 assume !(~n <= 0); 764399#L26 call #t~ret0 := fact(~n - 1);< 764402#factENTRY ~n := #in~n; 764409#L25 assume ~n <= 0;#res := 1; 764407#factFINAL assume true; 764398#factEXIT >#66#return; 764401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766674#factFINAL assume true; 766672#factEXIT >#68#return; 766386#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 766641#factENTRY ~n := #in~n; 766820#L25 assume !(~n <= 0); 766376#L26 call #t~ret0 := fact(~n - 1);< 766380#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766644#factFINAL assume true; 766640#factEXIT >#70#return; 766538#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766539#factENTRY ~n := #in~n; 766627#L25 assume ~n <= 0;#res := 1; 766625#factFINAL assume true; 766537#factEXIT >#72#return; 766533#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; 766527#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 766525#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 766484#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 766384#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; 766289#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766358#factENTRY ~n := #in~n; 766612#L25 assume !(~n <= 0); 766508#L26 call #t~ret0 := fact(~n - 1);< 766567#factENTRY ~n := #in~n; 766565#L25 assume !(~n <= 0); 766509#L26 call #t~ret0 := fact(~n - 1);< 766563#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766381#factFINAL assume true; 766286#factEXIT >#74#return; 765986#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 766283#factENTRY ~n := #in~n; 767010#L25 assume !(~n <= 0); 766373#L26 call #t~ret0 := fact(~n - 1);< 766526#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766282#factFINAL assume true; 765982#factEXIT >#76#return; 766014#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766281#factENTRY ~n := #in~n; 767428#L25 assume !(~n <= 0); 766373#L26 call #t~ret0 := fact(~n - 1);< 766526#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766282#factFINAL assume true; 765982#factEXIT >#78#return; 764199#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; 764200#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 770036#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 770035#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 770033#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; 769151#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 769152#factENTRY ~n := #in~n; 769177#L25 assume !(~n <= 0); 769162#L26 call #t~ret0 := fact(~n - 1);< 769175#factENTRY ~n := #in~n; 769675#L25 assume !(~n <= 0); 769161#L26 call #t~ret0 := fact(~n - 1);< 769490#factENTRY ~n := #in~n; 769675#L25 assume !(~n <= 0); 769161#L26 call #t~ret0 := fact(~n - 1);< 769490#factENTRY ~n := #in~n; 769499#L25 assume ~n <= 0;#res := 1; 769497#factFINAL assume true; 769487#factEXIT >#66#return; 769220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769211#factFINAL assume true; 769191#factEXIT >#66#return; 769190#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769183#factFINAL assume true; 769157#factEXIT >#66#return; 769156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769153#factFINAL assume true; 769148#factEXIT >#74#return; 768753#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 769147#factENTRY ~n := #in~n; 770446#L25 assume !(~n <= 0); 770426#L26 call #t~ret0 := fact(~n - 1);< 770445#factENTRY ~n := #in~n; 770560#L25 assume ~n <= 0;#res := 1; 770556#factFINAL assume true; 770550#factEXIT >#66#return; 770554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 771153#factFINAL assume true; 770583#factEXIT >#76#return; 770313#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 770326#factENTRY ~n := #in~n; 770688#L25 assume !(~n <= 0); 770423#L26 call #t~ret0 := fact(~n - 1);< 770449#factENTRY ~n := #in~n; 770522#L25 assume !(~n <= 0); 770514#L26 call #t~ret0 := fact(~n - 1);< 770519#factENTRY ~n := #in~n; 770572#L25 assume ~n <= 0;#res := 1; 770571#factFINAL assume true; 770513#factEXIT >#66#return; 770511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770448#factFINAL assume true; 770421#factEXIT >#66#return; 770438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770750#factFINAL assume true; 770312#factEXIT >#78#return; 770249#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; 770232#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 770230#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 770229#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 770224#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; 767501#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 767502#factENTRY ~n := #in~n; 770042#L25 assume !(~n <= 0); 770043#L26 call #t~ret0 := fact(~n - 1);< 770222#factENTRY ~n := #in~n; 770152#L25 assume !(~n <= 0); 764235#L26 call #t~ret0 := fact(~n - 1);< 770221#factENTRY ~n := #in~n; 770152#L25 assume !(~n <= 0); 764235#L26 call #t~ret0 := fact(~n - 1);< 770221#factENTRY ~n := #in~n; 770152#L25 assume !(~n <= 0); 764235#L26 call #t~ret0 := fact(~n - 1);< 770221#factENTRY ~n := #in~n; 770152#L25 assume !(~n <= 0); 764235#L26 call #t~ret0 := fact(~n - 1);< 770221#factENTRY ~n := #in~n; 770152#L25 assume !(~n <= 0); 764235#L26 call #t~ret0 := fact(~n - 1);< 770221#factENTRY ~n := #in~n; 770152#L25 assume !(~n <= 0); 764235#L26 call #t~ret0 := fact(~n - 1);< 770221#factENTRY ~n := #in~n; 770152#L25 assume !(~n <= 0); 764235#L26 call #t~ret0 := fact(~n - 1);< 770221#factENTRY ~n := #in~n; 764234#L25 assume ~n <= 0;#res := 1; 764236#factFINAL assume true; 770220#factEXIT >#66#return; 770218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770219#factFINAL assume true; 770214#factEXIT >#66#return; 770209#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770210#factFINAL assume true; 770168#factEXIT >#66#return; 770166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770167#factFINAL assume true; 770161#factEXIT >#66#return; 770162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770255#factFINAL assume true; 770254#factEXIT >#66#return; 770253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770252#factFINAL assume true; 770149#factEXIT >#66#return; 770147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770148#factFINAL assume true; 770141#factEXIT >#66#return; 770142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770096#factFINAL assume true; 770097#factEXIT >#66#return; 770250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768141#factFINAL assume true; 768147#factEXIT >#74#return; 767472#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 767473#factENTRY ~n := #in~n; 767489#L25 assume !(~n <= 0); 767479#L26 call #t~ret0 := fact(~n - 1);< 767485#factENTRY ~n := #in~n; 767490#L25 assume ~n <= 0;#res := 1; 767486#factFINAL assume true; 767476#factEXIT >#66#return; 767475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767474#factFINAL assume true; 767470#factEXIT >#76#return; 767361#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 767469#factENTRY ~n := #in~n; 767953#L25 assume !(~n <= 0); 767848#L26 call #t~ret0 := fact(~n - 1);< 767865#factENTRY ~n := #in~n; 767951#L25 assume !(~n <= 0); 767862#L26 call #t~ret0 := fact(~n - 1);< 767883#factENTRY ~n := #in~n; 767945#L25 assume !(~n <= 0); 767878#L26 call #t~ret0 := fact(~n - 1);< 767899#factENTRY ~n := #in~n; 767944#L25 assume !(~n <= 0); 767730#L26 call #t~ret0 := fact(~n - 1);< 767750#factENTRY ~n := #in~n; 767749#L25 assume !(~n <= 0); 767550#L26 call #t~ret0 := fact(~n - 1);< 767745#factENTRY ~n := #in~n; 767722#L25 assume !(~n <= 0); 767553#L26 call #t~ret0 := fact(~n - 1);< 767712#factENTRY ~n := #in~n; 767625#L25 assume ~n <= 0;#res := 1; 767623#factFINAL assume true; 767607#factEXIT >#66#return; 767604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767595#factFINAL assume true; 767544#factEXIT >#66#return; 767568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767762#factFINAL assume true; 767725#factEXIT >#66#return; 767735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767943#factFINAL assume true; 767930#factEXIT >#66#return; 767928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767916#factFINAL assume true; 767906#factEXIT >#66#return; 767903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767898#factFINAL assume true; 767875#factEXIT >#66#return; 767880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767994#factFINAL assume true; 767459#factEXIT >#78#return; 767359#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; 767358#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 767357#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 767356#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 767352#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 767313#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 767309#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 766938#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; 766936#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766937#factENTRY ~n := #in~n; 766948#L25 assume !(~n <= 0); 766942#L26 call #t~ret0 := fact(~n - 1);< 766946#factENTRY ~n := #in~n; 764417#L25 assume !(~n <= 0); 766944#L26 call #t~ret0 := fact(~n - 1);< 766955#factENTRY ~n := #in~n; 766957#L25 assume ~n <= 0;#res := 1; 767235#factFINAL assume true; 766966#factEXIT >#66#return; 766965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766954#factFINAL assume true; 766941#factEXIT >#66#return; 766940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766939#factFINAL assume true; 766935#factEXIT >#68#return; 764299#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764391#factENTRY ~n := #in~n; 764404#L25 assume ~n <= 0;#res := 1; 764394#factFINAL assume true; 764273#factEXIT >#70#return; 764358#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766843#factENTRY ~n := #in~n; 767227#L25 assume !(~n <= 0); 766490#L26 call #t~ret0 := fact(~n - 1);< 766925#factENTRY ~n := #in~n; 767454#L25 assume !(~n <= 0); 766487#L26 call #t~ret0 := fact(~n - 1);< 766562#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766866#factFINAL assume true; 766842#factEXIT >#72#return; 766841#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; 766832#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 766828#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 766827#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 766790#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; 766287#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766382#factENTRY ~n := #in~n; 766919#L25 assume !(~n <= 0); 766512#L26 call #t~ret0 := fact(~n - 1);< 766520#factENTRY ~n := #in~n; 767451#L25 assume !(~n <= 0); 764192#L26 call #t~ret0 := fact(~n - 1);< 764191#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766381#factFINAL assume true; 766286#factEXIT >#68#return; 766163#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 766610#factENTRY ~n := #in~n; 766920#L25 assume !(~n <= 0); 766368#L26 call #t~ret0 := fact(~n - 1);< 766380#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766282#factFINAL assume true; 765982#factEXIT >#70#return; 766238#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766637#factENTRY ~n := #in~n; 766667#L25 assume !(~n <= 0); 766374#L26 call #t~ret0 := fact(~n - 1);< 766526#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766638#factFINAL assume true; 766628#factEXIT >#72#return; 766626#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; 766624#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 766623#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 766619#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 766613#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; 766288#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766382#factENTRY ~n := #in~n; 766919#L25 assume !(~n <= 0); 766512#L26 call #t~ret0 := fact(~n - 1);< 766520#factENTRY ~n := #in~n; 767451#L25 assume !(~n <= 0); 764192#L26 call #t~ret0 := fact(~n - 1);< 764191#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766381#factFINAL assume true; 766286#factEXIT >#68#return; 766177#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 766610#factENTRY ~n := #in~n; 766920#L25 assume !(~n <= 0); 766368#L26 call #t~ret0 := fact(~n - 1);< 766380#factENTRY ~n := #in~n; 767451#L25 assume !(~n <= 0); 764192#L26 call #t~ret0 := fact(~n - 1);< 764191#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766381#factFINAL assume true; 766286#factEXIT >#70#return; 766357#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766597#factENTRY ~n := #in~n; 766611#L25 assume ~n <= 0;#res := 1; 766609#factFINAL assume true; 766569#factEXIT >#72#return; 766566#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; 766564#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 766560#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 766535#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 766524#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; 766439#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766483#factENTRY ~n := #in~n; 766614#L25 assume !(~n <= 0); 766501#L26 call #t~ret0 := fact(~n - 1);< 766567#factENTRY ~n := #in~n; 766565#L25 assume !(~n <= 0); 766509#L26 call #t~ret0 := fact(~n - 1);< 766563#factENTRY ~n := #in~n; 766565#L25 assume !(~n <= 0); 766509#L26 call #t~ret0 := fact(~n - 1);< 766563#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766521#factFINAL assume true; 766388#factEXIT >#74#return; 766290#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 766383#factENTRY ~n := #in~n; 767009#L25 assume !(~n <= 0); 766375#L26 call #t~ret0 := fact(~n - 1);< 766380#factENTRY ~n := #in~n; 767451#L25 assume !(~n <= 0); 764192#L26 call #t~ret0 := fact(~n - 1);< 764191#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766381#factFINAL assume true; 766286#factEXIT >#76#return; 766202#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766284#factENTRY ~n := #in~n; 767429#L25 assume !(~n <= 0); 766372#L26 call #t~ret0 := fact(~n - 1);< 766380#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766282#factFINAL assume true; 765982#factEXIT >#78#return; 766277#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; 767589#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 767590#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 770463#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 767593#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; 767594#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 769152#factENTRY ~n := #in~n; 769177#L25 assume !(~n <= 0); 769162#L26 call #t~ret0 := fact(~n - 1);< 769175#factENTRY ~n := #in~n; 769675#L25 assume !(~n <= 0); 769161#L26 call #t~ret0 := fact(~n - 1);< 769490#factENTRY ~n := #in~n; 769675#L25 assume !(~n <= 0); 769161#L26 call #t~ret0 := fact(~n - 1);< 769490#factENTRY ~n := #in~n; 769499#L25 assume ~n <= 0;#res := 1; 769497#factFINAL assume true; 769487#factEXIT >#66#return; 769220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769211#factFINAL assume true; 769191#factEXIT >#66#return; 769190#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769183#factFINAL assume true; 769157#factEXIT >#66#return; 769156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769153#factFINAL assume true; 769148#factEXIT >#74#return; 768752#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 769143#factENTRY ~n := #in~n; 769454#L25 assume !(~n <= 0); 768353#L26 call #t~ret0 := fact(~n - 1);< 769343#factENTRY ~n := #in~n; 768396#L25 assume !(~n <= 0); 768392#L26 call #t~ret0 := fact(~n - 1);< 768394#factENTRY ~n := #in~n; 768397#L25 assume ~n <= 0;#res := 1; 768395#factFINAL assume true; 768391#factEXIT >#66#return; 768390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768388#factFINAL assume true; 768331#factEXIT >#66#return; 768368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769452#factFINAL assume true; 769451#factEXIT >#76#return; 768389#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 768006#factENTRY ~n := #in~n; 769449#L25 assume !(~n <= 0); 768332#L26 call #t~ret0 := fact(~n - 1);< 768371#factENTRY ~n := #in~n; 768396#L25 assume !(~n <= 0); 768392#L26 call #t~ret0 := fact(~n - 1);< 768394#factENTRY ~n := #in~n; 768397#L25 assume ~n <= 0;#res := 1; 768395#factFINAL assume true; 768391#factEXIT >#66#return; 768390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768388#factFINAL assume true; 768331#factEXIT >#66#return; 768361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 770083#factFINAL assume true; 770081#factEXIT >#78#return; 768073#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; 770115#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 770114#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 770110#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 767805#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; 767641#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 767647#factENTRY ~n := #in~n; 767646#L25 assume !(~n <= 0); 767554#L26 call #t~ret0 := fact(~n - 1);< 767636#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767625#L25 assume ~n <= 0;#res := 1; 767623#factFINAL assume true; 767607#factEXIT >#66#return; 767604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767595#factFINAL assume true; 767544#factEXIT >#66#return; 767568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767762#factFINAL assume true; 767725#factEXIT >#66#return; 767735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767943#factFINAL assume true; 767930#factEXIT >#66#return; 767928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767916#factFINAL assume true; 767906#factEXIT >#66#return; 767903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767898#factFINAL assume true; 767875#factEXIT >#66#return; 767874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767871#factFINAL assume true; 767861#factEXIT >#66#return; 767859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767857#factFINAL assume true; 767845#factEXIT >#66#return; 767844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767843#factFINAL assume true; 767823#factEXIT >#66#return; 767826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767869#factFINAL assume true; 767867#factEXIT >#66#return; 767868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767872#factFINAL assume true; 767842#factEXIT >#74#return; 767758#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 767761#factENTRY ~n := #in~n; 767809#L25 assume !(~n <= 0); 767480#L26 call #t~ret0 := fact(~n - 1);< 767485#factENTRY ~n := #in~n; 767491#L25 assume !(~n <= 0); 767608#L26 call #t~ret0 := fact(~n - 1);< 767611#factENTRY ~n := #in~n; 767625#L25 assume ~n <= 0;#res := 1; 767623#factFINAL assume true; 767607#factEXIT >#66#return; 767604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767595#factFINAL assume true; 767544#factEXIT >#66#return; 767572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767774#factFINAL assume true; 767751#factEXIT >#76#return; 767686#L30-7 [2022-11-18 20:34:57,556 INFO L750 eck$LassoCheckResult]: Loop: 767686#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 767811#factENTRY ~n := #in~n; 767955#L25 assume !(~n <= 0); 767825#L26 call #t~ret0 := fact(~n - 1);< 767858#factENTRY ~n := #in~n; 767870#L25 assume !(~n <= 0); 767846#L26 call #t~ret0 := fact(~n - 1);< 767865#factENTRY ~n := #in~n; 767951#L25 assume !(~n <= 0); 767862#L26 call #t~ret0 := fact(~n - 1);< 767883#factENTRY ~n := #in~n; 767945#L25 assume !(~n <= 0); 767878#L26 call #t~ret0 := fact(~n - 1);< 767899#factENTRY ~n := #in~n; 767944#L25 assume !(~n <= 0); 767730#L26 call #t~ret0 := fact(~n - 1);< 767750#factENTRY ~n := #in~n; 767749#L25 assume !(~n <= 0); 767550#L26 call #t~ret0 := fact(~n - 1);< 767745#factENTRY ~n := #in~n; 767722#L25 assume !(~n <= 0); 767553#L26 call #t~ret0 := fact(~n - 1);< 767712#factENTRY ~n := #in~n; 767625#L25 assume ~n <= 0;#res := 1; 767623#factFINAL assume true; 767607#factEXIT >#66#return; 767604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767595#factFINAL assume true; 767544#factEXIT >#66#return; 767568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767762#factFINAL assume true; 767725#factEXIT >#66#return; 767735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767943#factFINAL assume true; 767930#factEXIT >#66#return; 767928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767916#factFINAL assume true; 767906#factEXIT >#66#return; 767903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767898#factFINAL assume true; 767875#factEXIT >#66#return; 767874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767871#factFINAL assume true; 767861#factEXIT >#66#return; 767864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 771133#factFINAL assume true; 771130#factEXIT >#78#return; 765981#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; 764209#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 764210#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 765980#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 764221#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 764213#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 764214#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 767431#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; 766958#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 764176#factENTRY ~n := #in~n; 766964#L25 assume !(~n <= 0); 766943#L26 call #t~ret0 := fact(~n - 1);< 766946#factENTRY ~n := #in~n; 764417#L25 assume !(~n <= 0); 766944#L26 call #t~ret0 := fact(~n - 1);< 766955#factENTRY ~n := #in~n; 764417#L25 assume !(~n <= 0); 766944#L26 call #t~ret0 := fact(~n - 1);< 766955#factENTRY ~n := #in~n; 764417#L25 assume !(~n <= 0); 766944#L26 call #t~ret0 := fact(~n - 1);< 766955#factENTRY ~n := #in~n; 766957#L25 assume ~n <= 0;#res := 1; 767235#factFINAL assume true; 766966#factEXIT >#66#return; 766965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766954#factFINAL assume true; 766941#factEXIT >#66#return; 766945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767206#factFINAL assume true; 767204#factEXIT >#66#return; 767202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767201#factFINAL assume true; 767200#factEXIT >#66#return; 767196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767287#factFINAL assume true; 767285#factEXIT >#68#return; 764303#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764391#factENTRY ~n := #in~n; 764404#L25 assume ~n <= 0;#res := 1; 764394#factFINAL assume true; 764273#factEXIT >#70#return; 764362#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 767232#factENTRY ~n := #in~n; 767230#L25 assume !(~n <= 0); 766548#L26 call #t~ret0 := fact(~n - 1);< 766991#factENTRY ~n := #in~n; 767017#L25 assume !(~n <= 0); 766507#L26 call #t~ret0 := fact(~n - 1);< 767005#factENTRY ~n := #in~n; 767032#L25 assume !(~n <= 0); 766514#L26 call #t~ret0 := fact(~n - 1);< 767030#factENTRY ~n := #in~n; 767081#L25 assume !(~n <= 0); 766516#L26 call #t~ret0 := fact(~n - 1);< 767058#factENTRY ~n := #in~n; 767097#L25 assume !(~n <= 0); 766491#L26 call #t~ret0 := fact(~n - 1);< 767095#factENTRY ~n := #in~n; 767238#L25 assume !(~n <= 0); 766496#L26 call #t~ret0 := fact(~n - 1);< 767115#factENTRY ~n := #in~n; 767308#L25 assume !(~n <= 0); 766498#L26 call #t~ret0 := fact(~n - 1);< 766861#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766859#factFINAL assume true; 766845#factEXIT >#66#return; 766856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767119#factFINAL assume true; 767112#factEXIT >#66#return; 767108#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767100#factFINAL assume true; 767090#factEXIT >#66#return; 767085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767068#factFINAL assume true; 767051#factEXIT >#66#return; 767055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767234#factFINAL assume true; 767151#factEXIT >#72#return; 767152#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; 768420#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 768419#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 767383#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 767384#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; 766435#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766522#factENTRY ~n := #in~n; 767087#L25 assume !(~n <= 0); 766552#L26 call #t~ret0 := fact(~n - 1);< 767071#factENTRY ~n := #in~n; 767392#L25 assume !(~n <= 0); 766513#L26 call #t~ret0 := fact(~n - 1);< 767095#factENTRY ~n := #in~n; 767238#L25 assume !(~n <= 0); 766496#L26 call #t~ret0 := fact(~n - 1);< 767115#factENTRY ~n := #in~n; 767308#L25 assume !(~n <= 0); 766498#L26 call #t~ret0 := fact(~n - 1);< 766861#factENTRY ~n := #in~n; 767266#L25 assume !(~n <= 0); 766497#L26 call #t~ret0 := fact(~n - 1);< 766651#factENTRY ~n := #in~n; 767442#L25 assume !(~n <= 0); 766489#L26 call #t~ret0 := fact(~n - 1);< 766562#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766859#factFINAL assume true; 766845#factEXIT >#66#return; 766856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767119#factFINAL assume true; 767112#factEXIT >#66#return; 767108#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767100#factFINAL assume true; 767090#factEXIT >#66#return; 767093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767252#factFINAL assume true; 766656#factEXIT >#68#return; 766175#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764239#factENTRY ~n := #in~n; 767008#L25 assume ~n <= 0;#res := 1; 766654#factFINAL assume true; 766993#factEXIT >#70#return; 766759#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 767139#factENTRY ~n := #in~n; 767164#L25 assume !(~n <= 0); 766852#L26 call #t~ret0 := fact(~n - 1);< 766992#factENTRY ~n := #in~n; 767036#L25 assume !(~n <= 0); 766551#L26 call #t~ret0 := fact(~n - 1);< 767006#factENTRY ~n := #in~n; 767049#L25 assume !(~n <= 0); 766511#L26 call #t~ret0 := fact(~n - 1);< 767029#factENTRY ~n := #in~n; 767081#L25 assume !(~n <= 0); 766516#L26 call #t~ret0 := fact(~n - 1);< 767058#factENTRY ~n := #in~n; 767097#L25 assume !(~n <= 0); 766491#L26 call #t~ret0 := fact(~n - 1);< 767095#factENTRY ~n := #in~n; 767238#L25 assume !(~n <= 0); 766496#L26 call #t~ret0 := fact(~n - 1);< 767115#factENTRY ~n := #in~n; 767308#L25 assume !(~n <= 0); 766498#L26 call #t~ret0 := fact(~n - 1);< 766861#factENTRY ~n := #in~n; 767266#L25 assume !(~n <= 0); 766497#L26 call #t~ret0 := fact(~n - 1);< 766651#factENTRY ~n := #in~n; 767442#L25 assume !(~n <= 0); 766489#L26 call #t~ret0 := fact(~n - 1);< 766562#factENTRY ~n := #in~n; 767451#L25 assume !(~n <= 0); 764192#L26 call #t~ret0 := fact(~n - 1);< 764191#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766859#factFINAL assume true; 766845#factEXIT >#66#return; 766856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767119#factFINAL assume true; 767112#factEXIT >#66#return; 767108#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767100#factFINAL assume true; 767090#factEXIT >#66#return; 767085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767068#factFINAL assume true; 767051#factEXIT >#66#return; 767048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767039#factFINAL assume true; 767020#factEXIT >#66#return; 767019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767013#factFINAL assume true; 766995#factEXIT >#66#return; 766994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766989#factFINAL assume true; 766974#factEXIT >#66#return; 766981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767169#factFINAL assume true; 766714#factEXIT >#72#return; 766779#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; 767423#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 767417#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 767418#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 767414#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; 766399#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766522#factENTRY ~n := #in~n; 767087#L25 assume !(~n <= 0); 766552#L26 call #t~ret0 := fact(~n - 1);< 767071#factENTRY ~n := #in~n; 767392#L25 assume !(~n <= 0); 766513#L26 call #t~ret0 := fact(~n - 1);< 767095#factENTRY ~n := #in~n; 767238#L25 assume !(~n <= 0); 766496#L26 call #t~ret0 := fact(~n - 1);< 767115#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766521#factFINAL assume true; 766388#factEXIT >#68#return; 766038#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 764239#factENTRY ~n := #in~n; 767008#L25 assume !(~n <= 0); 766365#L26 call #t~ret0 := fact(~n - 1);< 766568#factENTRY ~n := #in~n; 766565#L25 assume !(~n <= 0); 766509#L26 call #t~ret0 := fact(~n - 1);< 766563#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766381#factFINAL assume true; 766286#factEXIT >#70#return; 766351#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766883#factENTRY ~n := #in~n; 766926#L25 assume !(~n <= 0); 766377#L26 call #t~ret0 := fact(~n - 1);< 766380#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766638#factFINAL assume true; 766628#factEXIT >#72#return; 766635#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; 766879#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 766880#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 768379#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 766872#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; 766410#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766522#factENTRY ~n := #in~n; 767087#L25 assume !(~n <= 0); 766552#L26 call #t~ret0 := fact(~n - 1);< 767071#factENTRY ~n := #in~n; 767392#L25 assume !(~n <= 0); 766513#L26 call #t~ret0 := fact(~n - 1);< 767095#factENTRY ~n := #in~n; 767238#L25 assume !(~n <= 0); 766496#L26 call #t~ret0 := fact(~n - 1);< 767115#factENTRY ~n := #in~n; 767308#L25 assume !(~n <= 0); 766498#L26 call #t~ret0 := fact(~n - 1);< 766861#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766859#factFINAL assume true; 766845#factEXIT >#66#return; 766833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766829#factFINAL assume true; 766795#factEXIT >#68#return; 766105#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 766655#factENTRY ~n := #in~n; 766653#L25 assume !(~n <= 0); 766364#L26 call #t~ret0 := fact(~n - 1);< 766559#factENTRY ~n := #in~n; 767442#L25 assume !(~n <= 0); 766489#L26 call #t~ret0 := fact(~n - 1);< 766562#factENTRY ~n := #in~n; 767451#L25 assume !(~n <= 0); 764192#L26 call #t~ret0 := fact(~n - 1);< 764191#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766521#factFINAL assume true; 766388#factEXIT >#70#return; 766454#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766597#factENTRY ~n := #in~n; 766611#L25 assume ~n <= 0;#res := 1; 766609#factFINAL assume true; 766569#factEXIT >#72#return; 766595#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; 768320#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 768319#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 768318#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 768317#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; 766607#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 766621#factENTRY ~n := #in~n; 766616#L25 assume !(~n <= 0); 766492#L26 call #t~ret0 := fact(~n - 1);< 766567#factENTRY ~n := #in~n; 766565#L25 assume !(~n <= 0); 766509#L26 call #t~ret0 := fact(~n - 1);< 766563#factENTRY ~n := #in~n; 766565#L25 assume !(~n <= 0); 766509#L26 call #t~ret0 := fact(~n - 1);< 766563#factENTRY ~n := #in~n; 766565#L25 assume !(~n <= 0); 766509#L26 call #t~ret0 := fact(~n - 1);< 766563#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766859#factFINAL assume true; 766845#factEXIT >#66#return; 766833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766829#factFINAL assume true; 766795#factEXIT >#74#return; 766427#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 766712#factENTRY ~n := #in~n; 766710#L25 assume !(~n <= 0); 766550#L26 call #t~ret0 := fact(~n - 1);< 766680#factENTRY ~n := #in~n; 766675#L25 assume !(~n <= 0); 766506#L26 call #t~ret0 := fact(~n - 1);< 766520#factENTRY ~n := #in~n; 767451#L25 assume !(~n <= 0); 764192#L26 call #t~ret0 := fact(~n - 1);< 764191#factENTRY ~n := #in~n; 764193#L25 assume ~n <= 0;#res := 1; 766867#factFINAL assume true; 766561#factEXIT >#66#return; 766536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766528#factFINAL assume true; 766486#factEXIT >#66#return; 766518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766648#factFINAL assume true; 766540#factEXIT >#66#return; 766534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766521#factFINAL assume true; 766388#factEXIT >#76#return; 766124#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 766284#factENTRY ~n := #in~n; 767429#L25 assume !(~n <= 0); 766372#L26 call #t~ret0 := fact(~n - 1);< 766380#factENTRY ~n := #in~n; 766485#L25 assume ~n <= 0;#res := 1; 766385#factFINAL assume true; 766359#factEXIT >#66#return; 766285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 766282#factFINAL assume true; 765982#factEXIT >#78#return; 766217#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; 768298#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 768705#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 768704#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 768140#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; 768096#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 768097#factENTRY ~n := #in~n; 769453#L25 assume !(~n <= 0); 768269#L26 call #t~ret0 := fact(~n - 1);< 769124#factENTRY ~n := #in~n; 769527#L25 assume !(~n <= 0); 768255#L26 call #t~ret0 := fact(~n - 1);< 769513#factENTRY ~n := #in~n; 769527#L25 assume !(~n <= 0); 768255#L26 call #t~ret0 := fact(~n - 1);< 769513#factENTRY ~n := #in~n; 769527#L25 assume !(~n <= 0); 768255#L26 call #t~ret0 := fact(~n - 1);< 769513#factENTRY ~n := #in~n; 769527#L25 assume !(~n <= 0); 768255#L26 call #t~ret0 := fact(~n - 1);< 769513#factENTRY ~n := #in~n; 769527#L25 assume !(~n <= 0); 768255#L26 call #t~ret0 := fact(~n - 1);< 769513#factENTRY ~n := #in~n; 769530#L25 assume ~n <= 0;#res := 1; 769528#factFINAL assume true; 769511#factEXIT >#66#return; 769305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769046#factFINAL assume true; 768925#factEXIT >#66#return; 768939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769290#factFINAL assume true; 769273#factEXIT >#66#return; 769279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769247#factFINAL assume true; 769234#factEXIT >#66#return; 769238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 769404#factFINAL assume true; 768299#factEXIT >#66#return; 768297#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768292#factFINAL assume true; 768254#factEXIT >#66#return; 768253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768224#factFINAL assume true; 768183#factEXIT >#74#return; 768173#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 768182#factENTRY ~n := #in~n; 768776#L25 assume !(~n <= 0); 768714#L26 call #t~ret0 := fact(~n - 1);< 768729#factENTRY ~n := #in~n; 768736#L25 assume !(~n <= 0); 768336#L26 call #t~ret0 := fact(~n - 1);< 768371#factENTRY ~n := #in~n; 768396#L25 assume !(~n <= 0); 768392#L26 call #t~ret0 := fact(~n - 1);< 768394#factENTRY ~n := #in~n; 768397#L25 assume ~n <= 0;#res := 1; 768395#factFINAL assume true; 768391#factEXIT >#66#return; 768390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768388#factFINAL assume true; 768331#factEXIT >#66#return; 768362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768730#factFINAL assume true; 768708#factEXIT >#66#return; 768724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768771#factFINAL assume true; 768172#factEXIT >#76#return; 768165#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 768170#factENTRY ~n := #in~n; 768735#L25 assume !(~n <= 0); 768344#L26 call #t~ret0 := fact(~n - 1);< 768416#factENTRY ~n := #in~n; 768414#L25 assume !(~n <= 0); 768339#L26 call #t~ret0 := fact(~n - 1);< 768408#factENTRY ~n := #in~n; 768397#L25 assume ~n <= 0;#res := 1; 768395#factFINAL assume true; 768391#factEXIT >#66#return; 768390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768388#factFINAL assume true; 768331#factEXIT >#66#return; 768365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 768171#factFINAL assume true; 768163#factEXIT >#78#return; 768060#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; 768059#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 768058#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 768056#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 767719#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; 767645#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 767647#factENTRY ~n := #in~n; 767646#L25 assume !(~n <= 0); 767554#L26 call #t~ret0 := fact(~n - 1);< 767636#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767627#L25 assume !(~n <= 0); 767559#L26 call #t~ret0 := fact(~n - 1);< 767610#factENTRY ~n := #in~n; 767625#L25 assume ~n <= 0;#res := 1; 767623#factFINAL assume true; 767607#factEXIT >#66#return; 767604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767595#factFINAL assume true; 767544#factEXIT >#66#return; 767568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767762#factFINAL assume true; 767725#factEXIT >#66#return; 767735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767943#factFINAL assume true; 767930#factEXIT >#66#return; 767928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767916#factFINAL assume true; 767906#factEXIT >#66#return; 767903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767898#factFINAL assume true; 767875#factEXIT >#66#return; 767874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767871#factFINAL assume true; 767861#factEXIT >#66#return; 767859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767857#factFINAL assume true; 767845#factEXIT >#66#return; 767844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767843#factFINAL assume true; 767823#factEXIT >#66#return; 767826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767869#factFINAL assume true; 767867#factEXIT >#66#return; 767820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767819#factFINAL assume true; 767813#factEXIT >#66#return; 767808#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767802#factFINAL assume true; 767800#factEXIT >#74#return; 767672#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 767696#factENTRY ~n := #in~n; 767765#L25 assume !(~n <= 0); 767733#L26 call #t~ret0 := fact(~n - 1);< 767743#factENTRY ~n := #in~n; 767781#L25 assume !(~n <= 0); 767551#L26 call #t~ret0 := fact(~n - 1);< 767577#factENTRY ~n := #in~n; 767491#L25 assume !(~n <= 0); 767608#L26 call #t~ret0 := fact(~n - 1);< 767611#factENTRY ~n := #in~n; 767625#L25 assume ~n <= 0;#res := 1; 767623#factFINAL assume true; 767607#factEXIT >#66#return; 767604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767595#factFINAL assume true; 767544#factEXIT >#66#return; 767568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767762#factFINAL assume true; 767725#factEXIT >#66#return; 767721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 767705#factFINAL assume true; 767662#factEXIT >#76#return; 767686#L30-7 [2022-11-18 20:34:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash -393657004, now seen corresponding path program 54 times [2022-11-18 20:34:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:57,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622182244] [2022-11-18 20:34:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:57,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:34:57,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945073657] [2022-11-18 20:34:57,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:34:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:57,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:57,616 INFO L229 MonitoredProcess]: Starting monitored process 319 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:57,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (319)] Waiting until timeout for monitored process [2022-11-18 20:34:59,914 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-11-18 20:34:59,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:34:59,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:34:59,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 46657 backedges. 10247 proven. 151 refuted. 0 times theorem prover too weak. 36259 trivial. 0 not checked. [2022-11-18 20:35:00,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 46657 backedges. 1407 proven. 284 refuted. 0 times theorem prover too weak. 44966 trivial. 0 not checked. [2022-11-18 20:35:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:01,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622182244] [2022-11-18 20:35:01,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:35:01,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945073657] [2022-11-18 20:35:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945073657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:01,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:01,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 18 [2022-11-18 20:35:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008116371] [2022-11-18 20:35:01,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:01,414 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:35:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1963248495, now seen corresponding path program 38 times [2022-11-18 20:35:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:01,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83186542] [2022-11-18 20:35:01,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:01,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:35:01,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913392458] [2022-11-18 20:35:01,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:35:01,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:01,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:01,453 INFO L229 MonitoredProcess]: Starting monitored process 320 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:01,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (320)] Waiting until timeout for monitored process [2022-11-18 20:35:03,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:35:03,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:03,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:35:03,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26635 backedges. 9675 proven. 246 refuted. 0 times theorem prover too weak. 16714 trivial. 0 not checked. [2022-11-18 20:35:03,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 26635 backedges. 491 proven. 3764 refuted. 0 times theorem prover too weak. 22380 trivial. 0 not checked. [2022-11-18 20:35:06,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:06,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83186542] [2022-11-18 20:35:06,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:35:06,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913392458] [2022-11-18 20:35:06,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913392458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:06,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:06,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 28 [2022-11-18 20:35:06,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984980799] [2022-11-18 20:35:06,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:06,400 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:35:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:06,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:35:06,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:35:06,401 INFO L87 Difference]: Start difference. First operand 7079 states and 15347 transitions. cyclomatic complexity: 8324 Second operand has 28 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 16 states have call successors, (31), 2 states have call predecessors, (31), 12 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2022-11-18 20:35:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:08,141 INFO L93 Difference]: Finished difference Result 7902 states and 16512 transitions. [2022-11-18 20:35:08,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7902 states and 16512 transitions. [2022-11-18 20:35:08,224 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1419 [2022-11-18 20:35:08,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7902 states to 7900 states and 16510 transitions. [2022-11-18 20:35:08,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2814 [2022-11-18 20:35:08,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2814 [2022-11-18 20:35:08,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7900 states and 16510 transitions. [2022-11-18 20:35:08,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:35:08,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7900 states and 16510 transitions. [2022-11-18 20:35:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states and 16510 transitions. [2022-11-18 20:35:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7151. [2022-11-18 20:35:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7151 states, 3990 states have (on average 1.0411027568922306) internal successors, (4154), 3967 states have internal predecessors, (4154), 2382 states have call successors, (2476), 976 states have call predecessors, (2476), 779 states have return successors, (8953), 2207 states have call predecessors, (8953), 2382 states have call successors, (8953) [2022-11-18 20:35:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 15583 transitions. [2022-11-18 20:35:08,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7151 states and 15583 transitions. [2022-11-18 20:35:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 20:35:08,581 INFO L428 stractBuchiCegarLoop]: Abstraction has 7151 states and 15583 transitions. [2022-11-18 20:35:08,581 INFO L335 stractBuchiCegarLoop]: ======== Iteration 71 ============ [2022-11-18 20:35:08,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7151 states and 15583 transitions. [2022-11-18 20:35:08,620 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1108 [2022-11-18 20:35:08,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:35:08,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:35:08,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [136, 136, 89, 89, 89, 89, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:35:08,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [109, 109, 88, 88, 88, 88, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:35:08,626 INFO L748 eck$LassoCheckResult]: Stem: 788249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 788223#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; 788224#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 788248#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; 788278#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 788288#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 788286#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; 788284#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788285#factENTRY ~n := #in~n; 788293#L25 assume ~n <= 0;#res := 1; 788291#factFINAL assume true; 788283#factEXIT >#68#return; 788272#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788273#factENTRY ~n := #in~n; 788289#L25 assume ~n <= 0;#res := 1; 788287#factFINAL assume true; 788282#factEXIT >#70#return; 788172#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 788173#factENTRY ~n := #in~n; 788434#L25 assume ~n <= 0;#res := 1; 788301#factFINAL assume true; 788297#factEXIT >#72#return; 788242#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; 788243#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 788246#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 793769#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 793770#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; 793800#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 793801#factENTRY ~n := #in~n; 793854#L25 assume !(~n <= 0); 793845#L26 call #t~ret0 := fact(~n - 1);< 793846#factENTRY ~n := #in~n; 793853#L25 assume ~n <= 0;#res := 1; 793852#factFINAL assume true; 793844#factEXIT >#66#return; 793810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793811#factFINAL assume true; 793799#factEXIT >#74#return; 793797#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 793815#factENTRY ~n := #in~n; 793825#L25 assume ~n <= 0;#res := 1; 793796#factFINAL assume true; 793798#factEXIT >#76#return; 793785#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 793787#factENTRY ~n := #in~n; 793826#L25 assume !(~n <= 0); 793803#L26 call #t~ret0 := fact(~n - 1);< 793804#factENTRY ~n := #in~n; 793841#L25 assume ~n <= 0;#res := 1; 793840#factFINAL assume true; 793802#factEXIT >#66#return; 793794#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793795#factFINAL assume true; 793784#factEXIT >#78#return; 793786#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; 793780#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 793781#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 793833#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 793832#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; 793808#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 793827#factENTRY ~n := #in~n; 793862#L25 assume !(~n <= 0); 793848#L26 call #t~ret0 := fact(~n - 1);< 793850#factENTRY ~n := #in~n; 793860#L25 assume !(~n <= 0); 793849#L26 call #t~ret0 := fact(~n - 1);< 793858#factENTRY ~n := #in~n; 793861#L25 assume ~n <= 0;#res := 1; 793859#factFINAL assume true; 793857#factEXIT >#66#return; 793856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793855#factFINAL assume true; 793847#factEXIT >#66#return; 793842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793807#factFINAL assume true; 793809#factEXIT >#74#return; 793792#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 793793#factENTRY ~n := #in~n; 793805#L25 assume ~n <= 0;#res := 1; 793806#factFINAL assume true; 793791#factEXIT >#76#return; 793789#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 793814#factENTRY ~n := #in~n; 793824#L25 assume !(~n <= 0); 793820#L26 call #t~ret0 := fact(~n - 1);< 793823#factENTRY ~n := #in~n; 793839#L25 assume !(~n <= 0); 793819#L26 call #t~ret0 := fact(~n - 1);< 793836#factENTRY ~n := #in~n; 793838#L25 assume ~n <= 0;#res := 1; 793837#factFINAL assume true; 793835#factEXIT >#66#return; 793834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793828#factFINAL assume true; 793817#factEXIT >#66#return; 793816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793788#factFINAL assume true; 793790#factEXIT >#78#return; 793782#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; 793783#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 793813#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 793812#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 788252#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; 788253#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 793866#factENTRY ~n := #in~n; 793865#L25 assume !(~n <= 0); 793821#L26 call #t~ret0 := fact(~n - 1);< 793823#factENTRY ~n := #in~n; 793839#L25 assume !(~n <= 0); 793819#L26 call #t~ret0 := fact(~n - 1);< 793836#factENTRY ~n := #in~n; 793839#L25 assume !(~n <= 0); 793819#L26 call #t~ret0 := fact(~n - 1);< 793836#factENTRY ~n := #in~n; 793838#L25 assume ~n <= 0;#res := 1; 793837#factFINAL assume true; 793835#factEXIT >#66#return; 793834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793828#factFINAL assume true; 793817#factEXIT >#66#return; 793822#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793922#factFINAL assume true; 793917#factEXIT >#66#return; 793916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793915#factFINAL assume true; 793913#factEXIT >#74#return; 793903#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 793909#factENTRY ~n := #in~n; 794631#L25 assume ~n <= 0;#res := 1; 794630#factFINAL assume true; 794623#factEXIT >#76#return; 794554#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 794571#factENTRY ~n := #in~n; 794572#L25 assume !(~n <= 0); 794524#L26 call #t~ret0 := fact(~n - 1);< 794535#factENTRY ~n := #in~n; 794567#L25 assume !(~n <= 0); 794528#L26 call #t~ret0 := fact(~n - 1);< 794540#factENTRY ~n := #in~n; 794566#L25 assume !(~n <= 0); 794525#L26 call #t~ret0 := fact(~n - 1);< 794563#factENTRY ~n := #in~n; 794565#L25 assume ~n <= 0;#res := 1; 794564#factFINAL assume true; 794562#factEXIT >#66#return; 794561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794560#factFINAL assume true; 794559#factEXIT >#66#return; 794556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794553#factFINAL assume true; 794550#factEXIT >#66#return; 794531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794831#factFINAL assume true; 794638#factEXIT >#78#return; 794236#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; 794227#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 794225#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 794221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 794195#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; 794188#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 794192#factENTRY ~n := #in~n; 794190#L25 assume !(~n <= 0); 794152#L26 call #t~ret0 := fact(~n - 1);< 794186#factENTRY ~n := #in~n; 794181#L25 assume !(~n <= 0); 794153#L26 call #t~ret0 := fact(~n - 1);< 794176#factENTRY ~n := #in~n; 794181#L25 assume !(~n <= 0); 794153#L26 call #t~ret0 := fact(~n - 1);< 794176#factENTRY ~n := #in~n; 794181#L25 assume !(~n <= 0); 794153#L26 call #t~ret0 := fact(~n - 1);< 794176#factENTRY ~n := #in~n; 794179#L25 assume ~n <= 0;#res := 1; 794178#factFINAL assume true; 794177#factEXIT >#66#return; 794166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794167#factFINAL assume true; 794161#factEXIT >#66#return; 794162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794325#factFINAL assume true; 794151#factEXIT >#66#return; 794154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794317#factFINAL assume true; 794310#factEXIT >#66#return; 794309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794308#factFINAL assume true; 794253#factEXIT >#74#return; 788481#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 794237#factENTRY ~n := #in~n; 794344#L25 assume ~n <= 0;#res := 1; 788479#factFINAL assume true; 788482#factEXIT >#76#return; 794220#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 794235#factENTRY ~n := #in~n; 794219#L25 assume !(~n <= 0); 794120#L26 call #t~ret0 := fact(~n - 1);< 794200#factENTRY ~n := #in~n; 794213#L25 assume !(~n <= 0); 794124#L26 call #t~ret0 := fact(~n - 1);< 794204#factENTRY ~n := #in~n; 794214#L25 assume !(~n <= 0); 794126#L26 call #t~ret0 := fact(~n - 1);< 794210#factENTRY ~n := #in~n; 794214#L25 assume !(~n <= 0); 794126#L26 call #t~ret0 := fact(~n - 1);< 794210#factENTRY ~n := #in~n; 794214#L25 assume !(~n <= 0); 794126#L26 call #t~ret0 := fact(~n - 1);< 794210#factENTRY ~n := #in~n; 794214#L25 assume !(~n <= 0); 794126#L26 call #t~ret0 := fact(~n - 1);< 794210#factENTRY ~n := #in~n; 794214#L25 assume !(~n <= 0); 794126#L26 call #t~ret0 := fact(~n - 1);< 794210#factENTRY ~n := #in~n; 794212#L25 assume ~n <= 0;#res := 1; 794211#factFINAL assume true; 794209#factEXIT >#66#return; 794208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794207#factFINAL assume true; 794203#factEXIT >#66#return; 794202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794201#factFINAL assume true; 794198#factEXIT >#66#return; 794197#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794193#factFINAL assume true; 794189#factEXIT >#66#return; 794187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794185#factFINAL assume true; 794182#factEXIT >#66#return; 794180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794172#factFINAL assume true; 794168#factEXIT >#66#return; 794170#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794164#factFINAL assume true; 794165#factEXIT >#66#return; 794148#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 794307#factFINAL assume true; 794304#factEXIT >#78#return; 788466#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; 788465#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 788464#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 788463#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 788462#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 788461#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 788460#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 788448#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; 788438#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788439#factENTRY ~n := #in~n; 788457#L25 assume !(~n <= 0); 788454#L26 call #t~ret0 := fact(~n - 1);< 788455#factENTRY ~n := #in~n; 788458#L25 assume ~n <= 0;#res := 1; 788456#factFINAL assume true; 788453#factEXIT >#66#return; 788450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788447#factFINAL assume true; 788437#factEXIT >#68#return; 788363#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788433#factENTRY ~n := #in~n; 788446#L25 assume ~n <= 0;#res := 1; 788436#factFINAL assume true; 788303#factEXIT >#70#return; 788299#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 788300#factENTRY ~n := #in~n; 788445#L25 assume !(~n <= 0); 788441#L26 call #t~ret0 := fact(~n - 1);< 788444#factENTRY ~n := #in~n; 788451#L25 assume ~n <= 0;#res := 1; 788449#factFINAL assume true; 788440#factEXIT >#66#return; 788435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788302#factFINAL assume true; 788298#factEXIT >#72#return; 788296#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; 788295#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 788294#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 788292#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 788290#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; 788206#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788207#factENTRY ~n := #in~n; 788452#L25 assume !(~n <= 0); 788442#L26 call #t~ret0 := fact(~n - 1);< 788444#factENTRY ~n := #in~n; 788451#L25 assume ~n <= 0;#res := 1; 788449#factFINAL assume true; 788440#factEXIT >#66#return; 788443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789123#factFINAL assume true; 789121#factEXIT >#68#return; 789118#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 789119#factENTRY ~n := #in~n; 789179#L25 assume !(~n <= 0); 788263#L26 call #t~ret0 := fact(~n - 1);< 788934#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789158#factFINAL assume true; 789117#factEXIT >#70#return; 789046#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789047#factENTRY ~n := #in~n; 789135#L25 assume ~n <= 0;#res := 1; 789116#factFINAL assume true; 789045#factEXIT >#72#return; 789043#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; 789041#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 789039#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 789037#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 788938#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; 788838#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788917#factENTRY ~n := #in~n; 789290#L25 assume !(~n <= 0); 789095#L26 call #t~ret0 := fact(~n - 1);< 789173#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 788941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788935#factFINAL assume true; 788837#factEXIT >#74#return; 788574#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788835#factENTRY ~n := #in~n; 789590#L25 assume !(~n <= 0); 788931#L26 call #t~ret0 := fact(~n - 1);< 788940#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788834#factFINAL assume true; 788498#factEXIT >#76#return; 788625#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 790331#factENTRY ~n := #in~n; 789829#L25 assume !(~n <= 0); 788931#L26 call #t~ret0 := fact(~n - 1);< 788940#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788834#factFINAL assume true; 788498#factEXIT >#78#return; 788225#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; 788226#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 792142#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 792130#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 792128#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; 791027#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 791030#factENTRY ~n := #in~n; 791061#L25 assume !(~n <= 0); 791049#L26 call #t~ret0 := fact(~n - 1);< 791060#factENTRY ~n := #in~n; 791235#L25 assume !(~n <= 0); 791045#L26 call #t~ret0 := fact(~n - 1);< 791115#factENTRY ~n := #in~n; 791235#L25 assume !(~n <= 0); 791045#L26 call #t~ret0 := fact(~n - 1);< 791115#factENTRY ~n := #in~n; 791192#L25 assume ~n <= 0;#res := 1; 791191#factFINAL assume true; 791113#factEXIT >#66#return; 791112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791102#factFINAL assume true; 791067#factEXIT >#66#return; 791066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791062#factFINAL assume true; 791042#factEXIT >#66#return; 791039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791038#factFINAL assume true; 791026#factEXIT >#74#return; 790952#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 790956#factENTRY ~n := #in~n; 793557#L25 assume !(~n <= 0); 792400#L26 call #t~ret0 := fact(~n - 1);< 792406#factENTRY ~n := #in~n; 792457#L25 assume ~n <= 0;#res := 1; 792454#factFINAL assume true; 792394#factEXIT >#66#return; 792403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793556#factFINAL assume true; 793555#factEXIT >#76#return; 792541#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 793554#factENTRY ~n := #in~n; 793553#L25 assume !(~n <= 0); 792521#L26 call #t~ret0 := fact(~n - 1);< 792543#factENTRY ~n := #in~n; 792458#L25 assume !(~n <= 0); 792615#L26 call #t~ret0 := fact(~n - 1);< 792616#factENTRY ~n := #in~n; 792662#L25 assume ~n <= 0;#res := 1; 792647#factFINAL assume true; 792614#factEXIT >#66#return; 792613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 792540#factFINAL assume true; 792503#factEXIT >#66#return; 792534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793655#factFINAL assume true; 793653#factEXIT >#78#return; 790160#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; 790157#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 790154#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 790151#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 789980#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; 789955#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 789963#factENTRY ~n := #in~n; 790067#L25 assume !(~n <= 0); 789986#L26 call #t~ret0 := fact(~n - 1);< 789987#factENTRY ~n := #in~n; 790068#L25 assume !(~n <= 0); 789985#L26 call #t~ret0 := fact(~n - 1);< 790132#factENTRY ~n := #in~n; 790068#L25 assume !(~n <= 0); 789985#L26 call #t~ret0 := fact(~n - 1);< 790132#factENTRY ~n := #in~n; 790068#L25 assume !(~n <= 0); 789985#L26 call #t~ret0 := fact(~n - 1);< 790132#factENTRY ~n := #in~n; 790068#L25 assume !(~n <= 0); 789985#L26 call #t~ret0 := fact(~n - 1);< 790132#factENTRY ~n := #in~n; 790068#L25 assume !(~n <= 0); 789985#L26 call #t~ret0 := fact(~n - 1);< 790132#factENTRY ~n := #in~n; 790068#L25 assume !(~n <= 0); 789985#L26 call #t~ret0 := fact(~n - 1);< 790132#factENTRY ~n := #in~n; 790068#L25 assume !(~n <= 0); 789985#L26 call #t~ret0 := fact(~n - 1);< 790132#factENTRY ~n := #in~n; 790134#L25 assume ~n <= 0;#res := 1; 790133#factFINAL assume true; 790131#factEXIT >#66#return; 790129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790130#factFINAL assume true; 790144#factEXIT >#66#return; 790123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790124#factFINAL assume true; 790120#factEXIT >#66#return; 790119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790118#factFINAL assume true; 790117#factEXIT >#66#return; 790115#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790116#factFINAL assume true; 790135#factEXIT >#66#return; 790105#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790106#factFINAL assume true; 790136#factEXIT >#66#return; 790083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790084#factFINAL assume true; 790065#factEXIT >#66#return; 790060#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790061#factFINAL assume true; 789984#factEXIT >#66#return; 789982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789983#factFINAL assume true; 789950#factEXIT >#74#return; 789948#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 789949#factENTRY ~n := #in~n; 790020#L25 assume !(~n <= 0); 790012#L26 call #t~ret0 := fact(~n - 1);< 790016#factENTRY ~n := #in~n; 790022#L25 assume ~n <= 0;#res := 1; 790017#factFINAL assume true; 790008#factEXIT >#66#return; 790004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789993#factFINAL assume true; 789946#factEXIT >#76#return; 789835#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789945#factENTRY ~n := #in~n; 790818#L25 assume !(~n <= 0); 790622#L26 call #t~ret0 := fact(~n - 1);< 790633#factENTRY ~n := #in~n; 791957#L25 assume !(~n <= 0); 790620#L26 call #t~ret0 := fact(~n - 1);< 790667#factENTRY ~n := #in~n; 793691#L25 assume !(~n <= 0); 790618#L26 call #t~ret0 := fact(~n - 1);< 790815#factENTRY ~n := #in~n; 793744#L25 assume !(~n <= 0); 790662#L26 call #t~ret0 := fact(~n - 1);< 790877#factENTRY ~n := #in~n; 793734#L25 assume !(~n <= 0); 790809#L26 call #t~ret0 := fact(~n - 1);< 790931#factENTRY ~n := #in~n; 791182#L25 assume !(~n <= 0); 790865#L26 call #t~ret0 := fact(~n - 1);< 790988#factENTRY ~n := #in~n; 791088#L25 assume ~n <= 0;#res := 1; 791087#factFINAL assume true; 790980#factEXIT >#66#return; 790978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790975#factFINAL assume true; 790915#factEXIT >#66#return; 790914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790879#factFINAL assume true; 790858#factEXIT >#66#return; 790856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790847#factFINAL assume true; 790804#factEXIT >#66#return; 790773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790724#factFINAL assume true; 790654#factEXIT >#66#return; 790644#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790636#factFINAL assume true; 790598#factEXIT >#66#return; 790597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790592#factFINAL assume true; 789935#factEXIT >#78#return; 789830#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; 789828#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 789811#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 789810#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 789809#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 789802#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 789796#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 789209#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; 789204#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 789205#factENTRY ~n := #in~n; 789225#L25 assume !(~n <= 0); 789217#L26 call #t~ret0 := fact(~n - 1);< 789220#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 789231#L25 assume ~n <= 0;#res := 1; 789234#factFINAL assume true; 789230#factEXIT >#66#return; 789227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789223#factFINAL assume true; 789215#factEXIT >#66#return; 789213#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789208#factFINAL assume true; 789203#factEXIT >#68#return; 788352#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788433#factENTRY ~n := #in~n; 788446#L25 assume ~n <= 0;#res := 1; 788436#factFINAL assume true; 788303#factEXIT >#70#return; 788417#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789194#factENTRY ~n := #in~n; 789212#L25 assume !(~n <= 0); 789087#L26 call #t~ret0 := fact(~n - 1);< 789207#factENTRY ~n := #in~n; 794110#L25 assume !(~n <= 0); 788258#L26 call #t~ret0 := fact(~n - 1);< 789129#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789201#factFINAL assume true; 789193#factEXIT >#72#return; 789181#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; 789177#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 789175#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 789167#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 789133#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; 788839#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788936#factENTRY ~n := #in~n; 789397#L25 assume !(~n <= 0); 788219#L26 call #t~ret0 := fact(~n - 1);< 788215#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 788941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788935#factFINAL assume true; 788837#factEXIT >#68#return; 788698#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 789112#factENTRY ~n := #in~n; 789160#L25 assume !(~n <= 0); 788262#L26 call #t~ret0 := fact(~n - 1);< 788934#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788834#factFINAL assume true; 788498#factEXIT >#70#return; 788805#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789192#factENTRY ~n := #in~n; 789506#L25 assume !(~n <= 0); 788928#L26 call #t~ret0 := fact(~n - 1);< 788940#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788932#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789196#factFINAL assume true; 789183#factEXIT >#72#return; 789180#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; 789176#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 789174#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 789166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 789132#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; 788840#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788936#factENTRY ~n := #in~n; 789397#L25 assume !(~n <= 0); 788219#L26 call #t~ret0 := fact(~n - 1);< 788215#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 788941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788935#factFINAL assume true; 788837#factEXIT >#68#return; 788703#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 789112#factENTRY ~n := #in~n; 789160#L25 assume !(~n <= 0); 788262#L26 call #t~ret0 := fact(~n - 1);< 788934#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 788941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788935#factFINAL assume true; 788837#factEXIT >#70#return; 788915#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789081#factENTRY ~n := #in~n; 789122#L25 assume ~n <= 0;#res := 1; 789120#factFINAL assume true; 789050#factEXIT >#72#return; 789048#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; 789044#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 789042#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 789040#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 789038#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; 788994#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 789036#factENTRY ~n := #in~n; 789289#L25 assume !(~n <= 0); 789094#L26 call #t~ret0 := fact(~n - 1);< 789173#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789113#factFINAL assume true; 788942#factEXIT >#74#return; 788841#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788937#factENTRY ~n := #in~n; 789592#L25 assume !(~n <= 0); 788265#L26 call #t~ret0 := fact(~n - 1);< 788934#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 788941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788935#factFINAL assume true; 788837#factEXIT >#76#return; 788737#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 788833#factENTRY ~n := #in~n; 789833#L25 assume !(~n <= 0); 788264#L26 call #t~ret0 := fact(~n - 1);< 788934#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788834#factFINAL assume true; 788498#factEXIT >#78#return; 788820#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; 790322#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 790323#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 791952#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 790031#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; 790032#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 791030#factENTRY ~n := #in~n; 791061#L25 assume !(~n <= 0); 791049#L26 call #t~ret0 := fact(~n - 1);< 791060#factENTRY ~n := #in~n; 791235#L25 assume !(~n <= 0); 791045#L26 call #t~ret0 := fact(~n - 1);< 791115#factENTRY ~n := #in~n; 791235#L25 assume !(~n <= 0); 791045#L26 call #t~ret0 := fact(~n - 1);< 791115#factENTRY ~n := #in~n; 791192#L25 assume ~n <= 0;#res := 1; 791191#factFINAL assume true; 791113#factEXIT >#66#return; 791112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791102#factFINAL assume true; 791067#factEXIT >#66#return; 791066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791062#factFINAL assume true; 791042#factEXIT >#66#return; 791039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791038#factFINAL assume true; 791026#factEXIT >#74#return; 790951#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 790958#factENTRY ~n := #in~n; 792413#L25 assume !(~n <= 0); 792226#L26 call #t~ret0 := fact(~n - 1);< 792235#factENTRY ~n := #in~n; 792473#L25 assume !(~n <= 0); 792469#L26 call #t~ret0 := fact(~n - 1);< 792471#factENTRY ~n := #in~n; 792479#L25 assume ~n <= 0;#res := 1; 792476#factFINAL assume true; 792468#factEXIT >#66#return; 792466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 792460#factFINAL assume true; 792348#factEXIT >#66#return; 792380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793481#factFINAL assume true; 793480#factEXIT >#76#return; 792202#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 793462#factENTRY ~n := #in~n; 793424#L25 assume !(~n <= 0); 792356#L26 call #t~ret0 := fact(~n - 1);< 792382#factENTRY ~n := #in~n; 792473#L25 assume !(~n <= 0); 792469#L26 call #t~ret0 := fact(~n - 1);< 792471#factENTRY ~n := #in~n; 792479#L25 assume ~n <= 0;#res := 1; 792476#factFINAL assume true; 792468#factEXIT >#66#return; 792466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 792460#factFINAL assume true; 792348#factEXIT >#66#return; 792377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793760#factFINAL assume true; 792200#factEXIT >#78#return; 792137#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; 793751#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 793750#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 793748#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 791013#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; 790837#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788167#factENTRY ~n := #in~n; 791349#L25 assume !(~n <= 0); 790612#L26 call #t~ret0 := fact(~n - 1);< 791096#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791088#L25 assume ~n <= 0;#res := 1; 791087#factFINAL assume true; 790980#factEXIT >#66#return; 790978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790975#factFINAL assume true; 790915#factEXIT >#66#return; 790914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790879#factFINAL assume true; 790858#factEXIT >#66#return; 790856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790847#factFINAL assume true; 790804#factEXIT >#66#return; 790773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790724#factFINAL assume true; 790654#factEXIT >#66#return; 790644#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790636#factFINAL assume true; 790598#factEXIT >#66#return; 790629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791217#factFINAL assume true; 791139#factEXIT >#66#return; 791140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791203#factFINAL assume true; 791196#factEXIT >#66#return; 791195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791194#factFINAL assume true; 791032#factEXIT >#66#return; 791035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791101#factFINAL assume true; 791099#factEXIT >#66#return; 791100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791089#factFINAL assume true; 791086#factEXIT >#74#return; 790970#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 790974#factENTRY ~n := #in~n; 791189#L25 assume !(~n <= 0); 790010#L26 call #t~ret0 := fact(~n - 1);< 790016#factENTRY ~n := #in~n; 790023#L25 assume !(~n <= 0); 790981#L26 call #t~ret0 := fact(~n - 1);< 790982#factENTRY ~n := #in~n; 791088#L25 assume ~n <= 0;#res := 1; 791087#factFINAL assume true; 790980#factEXIT >#66#return; 790978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790975#factFINAL assume true; 790915#factEXIT >#66#return; 790923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791186#factFINAL assume true; 790990#factEXIT >#76#return; 790801#L30-7 [2022-11-18 20:35:08,626 INFO L750 eck$LassoCheckResult]: Loop: 790801#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 790967#factENTRY ~n := #in~n; 791202#L25 assume !(~n <= 0); 791034#L26 call #t~ret0 := fact(~n - 1);< 791201#factENTRY ~n := #in~n; 791199#L25 assume !(~n <= 0); 790610#L26 call #t~ret0 := fact(~n - 1);< 790633#factENTRY ~n := #in~n; 791957#L25 assume !(~n <= 0); 790620#L26 call #t~ret0 := fact(~n - 1);< 790667#factENTRY ~n := #in~n; 793691#L25 assume !(~n <= 0); 790618#L26 call #t~ret0 := fact(~n - 1);< 790815#factENTRY ~n := #in~n; 793744#L25 assume !(~n <= 0); 790662#L26 call #t~ret0 := fact(~n - 1);< 790877#factENTRY ~n := #in~n; 793734#L25 assume !(~n <= 0); 790809#L26 call #t~ret0 := fact(~n - 1);< 790931#factENTRY ~n := #in~n; 791182#L25 assume !(~n <= 0); 790865#L26 call #t~ret0 := fact(~n - 1);< 790988#factENTRY ~n := #in~n; 791088#L25 assume ~n <= 0;#res := 1; 791087#factFINAL assume true; 790980#factEXIT >#66#return; 790978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790975#factFINAL assume true; 790915#factEXIT >#66#return; 790914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790879#factFINAL assume true; 790858#factEXIT >#66#return; 790856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790847#factFINAL assume true; 790804#factEXIT >#66#return; 790773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790724#factFINAL assume true; 790654#factEXIT >#66#return; 790644#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790636#factFINAL assume true; 790598#factEXIT >#66#return; 790629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791217#factFINAL assume true; 791139#factEXIT >#66#return; 791141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 792977#factFINAL assume true; 792828#factEXIT >#78#return; 789939#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; 788235#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 788236#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 788497#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 788247#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 788238#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 788239#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 792027#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; 789239#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788205#factENTRY ~n := #in~n; 789242#L25 assume !(~n <= 0); 789216#L26 call #t~ret0 := fact(~n - 1);< 789220#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 788459#L25 assume !(~n <= 0); 789218#L26 call #t~ret0 := fact(~n - 1);< 789224#factENTRY ~n := #in~n; 789231#L25 assume ~n <= 0;#res := 1; 789234#factFINAL assume true; 789230#factEXIT >#66#return; 789227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789223#factFINAL assume true; 789215#factEXIT >#66#return; 789219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789703#factFINAL assume true; 789699#factEXIT >#66#return; 789698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789696#factFINAL assume true; 789693#factEXIT >#66#return; 789681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789679#factFINAL assume true; 789677#factEXIT >#66#return; 789675#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789674#factFINAL assume true; 789672#factEXIT >#66#return; 789671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789669#factFINAL assume true; 789666#factEXIT >#66#return; 789664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789662#factFINAL assume true; 789660#factEXIT >#66#return; 789659#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789657#factFINAL assume true; 789655#factEXIT >#66#return; 789656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789752#factFINAL assume true; 789751#factEXIT >#68#return; 788332#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788433#factENTRY ~n := #in~n; 788446#L25 assume ~n <= 0;#res := 1; 788436#factFINAL assume true; 788303#factEXIT >#70#return; 788397#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789740#factENTRY ~n := #in~n; 789738#L25 assume !(~n <= 0); 789338#L26 call #t~ret0 := fact(~n - 1);< 789372#factENTRY ~n := #in~n; 789805#L25 assume !(~n <= 0); 789362#L26 call #t~ret0 := fact(~n - 1);< 789395#factENTRY ~n := #in~n; 789799#L25 assume !(~n <= 0); 789388#L26 call #t~ret0 := fact(~n - 1);< 789521#factENTRY ~n := #in~n; 789780#L25 assume !(~n <= 0); 789515#L26 call #t~ret0 := fact(~n - 1);< 789631#factENTRY ~n := #in~n; 789695#L25 assume !(~n <= 0); 789617#L26 call #t~ret0 := fact(~n - 1);< 789692#factENTRY ~n := #in~n; 789705#L25 assume !(~n <= 0); 789151#L26 call #t~ret0 := fact(~n - 1);< 789690#factENTRY ~n := #in~n; 789755#L25 assume !(~n <= 0); 789083#L26 call #t~ret0 := fact(~n - 1);< 789169#factENTRY ~n := #in~n; 789801#L25 assume !(~n <= 0); 789088#L26 call #t~ret0 := fact(~n - 1);< 789170#factENTRY ~n := #in~n; 789846#L25 assume !(~n <= 0); 788261#L26 call #t~ret0 := fact(~n - 1);< 789129#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789742#factFINAL assume true; 789726#factEXIT >#66#return; 789722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789715#factFINAL assume true; 789682#factEXIT >#66#return; 789680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789630#factFINAL assume true; 789613#factEXIT >#66#return; 789618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789534#factFINAL assume true; 789514#factEXIT >#66#return; 789513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789510#factFINAL assume true; 789383#factEXIT >#66#return; 789382#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789371#factFINAL assume true; 789359#factEXIT >#66#return; 789358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789349#factFINAL assume true; 789337#factEXIT >#66#return; 789347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789636#factFINAL assume true; 789609#factEXIT >#72#return; 789599#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; 792021#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 792020#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 792019#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 792018#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; 788987#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 789036#factENTRY ~n := #in~n; 789289#L25 assume !(~n <= 0); 789094#L26 call #t~ret0 := fact(~n - 1);< 789173#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789742#factFINAL assume true; 789726#factEXIT >#66#return; 789722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789715#factFINAL assume true; 789682#factEXIT >#66#return; 789680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789630#factFINAL assume true; 789613#factEXIT >#66#return; 789618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789534#factFINAL assume true; 789514#factEXIT >#66#return; 789513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789510#factFINAL assume true; 789383#factEXIT >#66#return; 789382#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789371#factFINAL assume true; 789359#factEXIT >#66#return; 789367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789533#factFINAL assume true; 789532#factEXIT >#68#return; 788748#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788271#factENTRY ~n := #in~n; 789591#L25 assume !(~n <= 0); 788929#L26 call #t~ret0 := fact(~n - 1);< 789276#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788834#factFINAL assume true; 788498#factEXIT >#70#return; 788825#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789571#factENTRY ~n := #in~n; 789804#L25 assume !(~n <= 0); 789389#L26 call #t~ret0 := fact(~n - 1);< 789393#factENTRY ~n := #in~n; 789800#L25 assume !(~n <= 0); 789517#L26 call #t~ret0 := fact(~n - 1);< 789522#factENTRY ~n := #in~n; 789779#L25 assume !(~n <= 0); 789616#L26 call #t~ret0 := fact(~n - 1);< 789634#factENTRY ~n := #in~n; 789743#L25 assume !(~n <= 0); 789683#L26 call #t~ret0 := fact(~n - 1);< 789689#factENTRY ~n := #in~n; 789790#L25 assume !(~n <= 0); 789727#L26 call #t~ret0 := fact(~n - 1);< 789731#factENTRY ~n := #in~n; 789766#L25 assume !(~n <= 0); 789140#L26 call #t~ret0 := fact(~n - 1);< 789156#factENTRY ~n := #in~n; 789275#L25 assume !(~n <= 0); 788216#L26 call #t~ret0 := fact(~n - 1);< 788215#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789742#factFINAL assume true; 789726#factEXIT >#66#return; 789722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789715#factFINAL assume true; 789682#factEXIT >#66#return; 789680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789630#factFINAL assume true; 789613#factEXIT >#66#return; 789618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789534#factFINAL assume true; 789514#factEXIT >#66#return; 789513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789510#factFINAL assume true; 789383#factEXIT >#66#return; 789391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789577#factFINAL assume true; 789574#factEXIT >#72#return; 789465#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; 791995#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 791994#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 791993#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 791991#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; 788957#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 789036#factENTRY ~n := #in~n; 789289#L25 assume !(~n <= 0); 789094#L26 call #t~ret0 := fact(~n - 1);< 789173#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789113#factFINAL assume true; 788942#factEXIT >#68#return; 788579#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 788271#factENTRY ~n := #in~n; 789591#L25 assume !(~n <= 0); 788929#L26 call #t~ret0 := fact(~n - 1);< 789276#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 788941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788935#factFINAL assume true; 788837#factEXIT >#70#return; 788916#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 788171#factENTRY ~n := #in~n; 789826#L25 assume !(~n <= 0); 788260#L26 call #t~ret0 := fact(~n - 1);< 788934#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788932#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789196#factFINAL assume true; 789183#factEXIT >#72#return; 789189#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; 791990#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 791989#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 791988#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 791987#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; 788982#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 789114#factENTRY ~n := #in~n; 789541#L25 assume !(~n <= 0); 789150#L26 call #t~ret0 := fact(~n - 1);< 789537#factENTRY ~n := #in~n; 789924#L25 assume !(~n <= 0); 789105#L26 call #t~ret0 := fact(~n - 1);< 789632#factENTRY ~n := #in~n; 789697#L25 assume !(~n <= 0); 789108#L26 call #t~ret0 := fact(~n - 1);< 789691#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789113#factFINAL assume true; 788942#factEXIT >#68#return; 788659#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 789311#factENTRY ~n := #in~n; 789309#L25 assume !(~n <= 0); 788930#L26 call #t~ret0 := fact(~n - 1);< 789157#factENTRY ~n := #in~n; 789846#L25 assume !(~n <= 0); 788261#L26 call #t~ret0 := fact(~n - 1);< 789129#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789113#factFINAL assume true; 788942#factEXIT >#70#return; 789004#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 789081#factENTRY ~n := #in~n; 789122#L25 assume ~n <= 0;#res := 1; 789120#factFINAL assume true; 789050#factEXIT >#72#return; 789076#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; 793350#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 793349#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 789923#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 789783#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; 789278#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 789295#factENTRY ~n := #in~n; 789292#L25 assume !(~n <= 0); 789084#L26 call #t~ret0 := fact(~n - 1);< 789173#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789165#L25 assume !(~n <= 0); 789093#L26 call #t~ret0 := fact(~n - 1);< 789131#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789742#factFINAL assume true; 789726#factEXIT >#66#return; 789730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789770#factFINAL assume true; 789505#factEXIT >#74#return; 789000#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 789745#factENTRY ~n := #in~n; 789744#L25 assume !(~n <= 0); 789149#L26 call #t~ret0 := fact(~n - 1);< 789156#factENTRY ~n := #in~n; 789275#L25 assume !(~n <= 0); 788216#L26 call #t~ret0 := fact(~n - 1);< 788215#factENTRY ~n := #in~n; 788217#L25 assume !(~n <= 0); 788259#L26 call #t~ret0 := fact(~n - 1);< 789130#factENTRY ~n := #in~n; 789162#L25 assume ~n <= 0;#res := 1; 789159#factFINAL assume true; 789128#factEXIT >#66#return; 789127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789124#factFINAL assume true; 789082#factEXIT >#66#return; 789109#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789168#factFINAL assume true; 789136#factEXIT >#66#return; 789134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 789113#factFINAL assume true; 788942#factEXIT >#76#return; 788499#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 788833#factENTRY ~n := #in~n; 789833#L25 assume !(~n <= 0); 788264#L26 call #t~ret0 := fact(~n - 1);< 788934#factENTRY ~n := #in~n; 789049#L25 assume ~n <= 0;#res := 1; 788939#factFINAL assume true; 788918#factEXIT >#66#return; 788836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 788834#factFINAL assume true; 788498#factEXIT >#78#return; 788758#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; 791962#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 791961#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 791956#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 791955#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; 790693#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 790721#factENTRY ~n := #in~n; 793693#L25 assume !(~n <= 0); 790744#L26 call #t~ret0 := fact(~n - 1);< 790772#factENTRY ~n := #in~n; 791464#L25 assume !(~n <= 0); 790742#L26 call #t~ret0 := fact(~n - 1);< 791361#factENTRY ~n := #in~n; 791464#L25 assume !(~n <= 0); 790742#L26 call #t~ret0 := fact(~n - 1);< 791361#factENTRY ~n := #in~n; 791464#L25 assume !(~n <= 0); 790742#L26 call #t~ret0 := fact(~n - 1);< 791361#factENTRY ~n := #in~n; 791464#L25 assume !(~n <= 0); 790742#L26 call #t~ret0 := fact(~n - 1);< 791361#factENTRY ~n := #in~n; 791464#L25 assume !(~n <= 0); 790742#L26 call #t~ret0 := fact(~n - 1);< 791361#factENTRY ~n := #in~n; 791391#L25 assume ~n <= 0;#res := 1; 791385#factFINAL assume true; 791356#factEXIT >#66#return; 791355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791323#factFINAL assume true; 791284#factEXIT >#66#return; 791278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791274#factFINAL assume true; 791249#factEXIT >#66#return; 791244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791236#factFINAL assume true; 791220#factEXIT >#66#return; 791018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790943#factFINAL assume true; 790897#factEXIT >#66#return; 790851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790825#factFINAL assume true; 790737#factEXIT >#66#return; 790735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790720#factFINAL assume true; 790672#factEXIT >#74#return; 790714#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 791864#factENTRY ~n := #in~n; 793764#L25 assume !(~n <= 0); 792417#L26 call #t~ret0 := fact(~n - 1);< 792497#factENTRY ~n := #in~n; 792496#L25 assume !(~n <= 0); 792349#L26 call #t~ret0 := fact(~n - 1);< 792382#factENTRY ~n := #in~n; 792473#L25 assume !(~n <= 0); 792469#L26 call #t~ret0 := fact(~n - 1);< 792471#factENTRY ~n := #in~n; 792479#L25 assume ~n <= 0;#res := 1; 792476#factFINAL assume true; 792468#factEXIT >#66#return; 792466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 792460#factFINAL assume true; 792348#factEXIT >#66#return; 792372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 792450#factFINAL assume true; 792416#factEXIT >#66#return; 792435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793505#factFINAL assume true; 793503#factEXIT >#76#return; 792192#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 792324#factENTRY ~n := #in~n; 792725#L25 assume !(~n <= 0); 792352#L26 call #t~ret0 := fact(~n - 1);< 792453#factENTRY ~n := #in~n; 792700#L25 assume !(~n <= 0); 792367#L26 call #t~ret0 := fact(~n - 1);< 792642#factENTRY ~n := #in~n; 792479#L25 assume ~n <= 0;#res := 1; 792476#factFINAL assume true; 792468#factEXIT >#66#return; 792466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 792460#factFINAL assume true; 792348#factEXIT >#66#return; 792376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 793628#factFINAL assume true; 792320#factEXIT >#78#return; 792138#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; 793670#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 793631#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 793630#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 790854#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; 790838#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 788167#factENTRY ~n := #in~n; 791349#L25 assume !(~n <= 0); 790612#L26 call #t~ret0 := fact(~n - 1);< 791096#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791090#L25 assume !(~n <= 0); 790602#L26 call #t~ret0 := fact(~n - 1);< 790985#factENTRY ~n := #in~n; 791088#L25 assume ~n <= 0;#res := 1; 791087#factFINAL assume true; 790980#factEXIT >#66#return; 790978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790975#factFINAL assume true; 790915#factEXIT >#66#return; 790914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790879#factFINAL assume true; 790858#factEXIT >#66#return; 790856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790847#factFINAL assume true; 790804#factEXIT >#66#return; 790773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790724#factFINAL assume true; 790654#factEXIT >#66#return; 790644#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790636#factFINAL assume true; 790598#factEXIT >#66#return; 790629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791217#factFINAL assume true; 791139#factEXIT >#66#return; 791140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791203#factFINAL assume true; 791196#factEXIT >#66#return; 791195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791194#factFINAL assume true; 791032#factEXIT >#66#return; 791035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791101#factFINAL assume true; 791099#factEXIT >#66#return; 791100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 791089#factFINAL assume true; 791086#factEXIT >#74#return; 790780#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 790803#factENTRY ~n := #in~n; 790913#L25 assume !(~n <= 0); 790863#L26 call #t~ret0 := fact(~n - 1);< 790872#factENTRY ~n := #in~n; 793731#L25 assume !(~n <= 0); 790918#L26 call #t~ret0 := fact(~n - 1);< 790933#factENTRY ~n := #in~n; 790023#L25 assume !(~n <= 0); 790981#L26 call #t~ret0 := fact(~n - 1);< 790982#factENTRY ~n := #in~n; 791088#L25 assume ~n <= 0;#res := 1; 791087#factFINAL assume true; 790980#factEXIT >#66#return; 790978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790975#factFINAL assume true; 790915#factEXIT >#66#return; 790914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790879#factFINAL assume true; 790858#factEXIT >#66#return; 790852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 790829#factFINAL assume true; 790774#factEXIT >#76#return; 790801#L30-7 [2022-11-18 20:35:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1616320748, now seen corresponding path program 55 times [2022-11-18 20:35:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:08,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862207759] [2022-11-18 20:35:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:08,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:35:08,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748627495] [2022-11-18 20:35:08,675 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:35:08,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:08,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:08,683 INFO L229 MonitoredProcess]: Starting monitored process 321 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:08,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (321)] Waiting until timeout for monitored process [2022-11-18 20:35:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:10,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 1894 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:35:10,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 45207 backedges. 18907 proven. 79 refuted. 0 times theorem prover too weak. 26221 trivial. 0 not checked. [2022-11-18 20:35:11,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 45207 backedges. 975 proven. 2225 refuted. 0 times theorem prover too weak. 42007 trivial. 0 not checked. [2022-11-18 20:35:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862207759] [2022-11-18 20:35:13,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:35:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748627495] [2022-11-18 20:35:13,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748627495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:13,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:13,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 26 [2022-11-18 20:35:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651243047] [2022-11-18 20:35:13,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:13,068 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:35:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1786165679, now seen corresponding path program 39 times [2022-11-18 20:35:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:13,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450928893] [2022-11-18 20:35:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:13,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:35:13,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266129566] [2022-11-18 20:35:13,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:35:13,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:13,125 INFO L229 MonitoredProcess]: Starting monitored process 322 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:13,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (322)] Waiting until timeout for monitored process [2022-11-18 20:35:15,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-11-18 20:35:15,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:15,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:35:15,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31315 backedges. 12241 proven. 226 refuted. 0 times theorem prover too weak. 18848 trivial. 0 not checked. [2022-11-18 20:35:15,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 31315 backedges. 4651 proven. 1148 refuted. 0 times theorem prover too weak. 25516 trivial. 0 not checked. [2022-11-18 20:35:18,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:18,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450928893] [2022-11-18 20:35:18,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:35:18,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266129566] [2022-11-18 20:35:18,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266129566] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:18,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:18,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 27 [2022-11-18 20:35:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164270586] [2022-11-18 20:35:18,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:18,407 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:35:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:35:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-11-18 20:35:18,408 INFO L87 Difference]: Start difference. First operand 7151 states and 15583 transitions. cyclomatic complexity: 8488 Second operand has 27 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 16 states have call successors, (26), 2 states have call predecessors, (26), 12 states have return successors, (34), 14 states have call predecessors, (34), 16 states have call successors, (34) [2022-11-18 20:35:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:19,742 INFO L93 Difference]: Finished difference Result 8703 states and 17960 transitions. [2022-11-18 20:35:19,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8703 states and 17960 transitions. [2022-11-18 20:35:19,827 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1577 [2022-11-18 20:35:19,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8703 states to 8670 states and 17901 transitions. [2022-11-18 20:35:19,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2844 [2022-11-18 20:35:19,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2844 [2022-11-18 20:35:19,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8670 states and 17901 transitions. [2022-11-18 20:35:19,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:35:19,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8670 states and 17901 transitions. [2022-11-18 20:35:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states and 17901 transitions. [2022-11-18 20:35:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 7174. [2022-11-18 20:35:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7174 states, 3998 states have (on average 1.040520260130065) internal successors, (4160), 3973 states have internal predecessors, (4160), 2397 states have call successors, (2488), 982 states have call predecessors, (2488), 779 states have return successors, (8987), 2218 states have call predecessors, (8987), 2397 states have call successors, (8987) [2022-11-18 20:35:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7174 states to 7174 states and 15635 transitions. [2022-11-18 20:35:20,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7174 states and 15635 transitions. [2022-11-18 20:35:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:35:20,165 INFO L428 stractBuchiCegarLoop]: Abstraction has 7174 states and 15635 transitions. [2022-11-18 20:35:20,165 INFO L335 stractBuchiCegarLoop]: ======== Iteration 72 ============ [2022-11-18 20:35:20,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7174 states and 15635 transitions. [2022-11-18 20:35:20,196 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1116 [2022-11-18 20:35:20,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:35:20,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:35:20,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [141, 141, 94, 94, 94, 94, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:35:20,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [124, 124, 103, 103, 103, 103, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:35:20,202 INFO L748 eck$LassoCheckResult]: Stem: 813318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 813290#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; 813291#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 813317#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; 813349#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 813360#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 813358#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; 813356#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813357#factENTRY ~n := #in~n; 813365#L25 assume ~n <= 0;#res := 1; 813363#factFINAL assume true; 813355#factEXIT >#68#return; 813343#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813344#factENTRY ~n := #in~n; 813361#L25 assume ~n <= 0;#res := 1; 813359#factFINAL assume true; 813354#factEXIT >#70#return; 813274#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 813275#factENTRY ~n := #in~n; 813505#L25 assume ~n <= 0;#res := 1; 813373#factFINAL assume true; 813369#factEXIT >#72#return; 813311#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; 813312#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 813314#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 814050#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 814046#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; 814039#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 814040#factENTRY ~n := #in~n; 814052#L25 assume !(~n <= 0); 814048#L26 call #t~ret0 := fact(~n - 1);< 814049#factENTRY ~n := #in~n; 814053#L25 assume ~n <= 0;#res := 1; 814051#factFINAL assume true; 814047#factEXIT >#66#return; 814045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814044#factFINAL assume true; 814038#factEXIT >#74#return; 814021#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 814022#factENTRY ~n := #in~n; 814037#L25 assume ~n <= 0;#res := 1; 814036#factFINAL assume true; 814020#factEXIT >#76#return; 814018#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 814019#factENTRY ~n := #in~n; 814034#L25 assume !(~n <= 0); 814031#L26 call #t~ret0 := fact(~n - 1);< 814032#factENTRY ~n := #in~n; 814035#L25 assume ~n <= 0;#res := 1; 814033#factFINAL assume true; 814030#factEXIT >#66#return; 814029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814027#factFINAL assume true; 814017#factEXIT >#78#return; 814014#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; 814011#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 814006#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 814000#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 813994#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; 813982#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813983#factENTRY ~n := #in~n; 814010#L25 assume !(~n <= 0); 814003#L26 call #t~ret0 := fact(~n - 1);< 814005#factENTRY ~n := #in~n; 814043#L25 assume !(~n <= 0); 814004#L26 call #t~ret0 := fact(~n - 1);< 814025#factENTRY ~n := #in~n; 814042#L25 assume ~n <= 0;#res := 1; 814041#factFINAL assume true; 814024#factEXIT >#66#return; 814023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814009#factFINAL assume true; 814002#factEXIT >#66#return; 813999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813993#factFINAL assume true; 813981#factEXIT >#74#return; 813977#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813978#factENTRY ~n := #in~n; 813991#L25 assume ~n <= 0;#res := 1; 813980#factFINAL assume true; 813976#factEXIT >#76#return; 813973#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 813974#factENTRY ~n := #in~n; 813992#L25 assume !(~n <= 0); 813986#L26 call #t~ret0 := fact(~n - 1);< 813990#factENTRY ~n := #in~n; 814016#L25 assume !(~n <= 0); 813987#L26 call #t~ret0 := fact(~n - 1);< 814008#factENTRY ~n := #in~n; 814015#L25 assume ~n <= 0;#res := 1; 814013#factFINAL assume true; 814007#factEXIT >#66#return; 814001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813995#factFINAL assume true; 813984#factEXIT >#66#return; 813979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813975#factFINAL assume true; 813972#factEXIT >#78#return; 813971#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; 813970#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 813969#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 813968#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 813967#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; 813961#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 814028#factENTRY ~n := #in~n; 814026#L25 assume !(~n <= 0); 813985#L26 call #t~ret0 := fact(~n - 1);< 813990#factENTRY ~n := #in~n; 814016#L25 assume !(~n <= 0); 813987#L26 call #t~ret0 := fact(~n - 1);< 814008#factENTRY ~n := #in~n; 814016#L25 assume !(~n <= 0); 813987#L26 call #t~ret0 := fact(~n - 1);< 814008#factENTRY ~n := #in~n; 814015#L25 assume ~n <= 0;#res := 1; 814013#factFINAL assume true; 814007#factEXIT >#66#return; 814001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813995#factFINAL assume true; 813984#factEXIT >#66#return; 813989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814061#factFINAL assume true; 814057#factEXIT >#66#return; 814056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814055#factFINAL assume true; 813960#factEXIT >#74#return; 813937#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813956#factENTRY ~n := #in~n; 814583#L25 assume ~n <= 0;#res := 1; 814582#factFINAL assume true; 814581#factEXIT >#76#return; 813751#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 814574#factENTRY ~n := #in~n; 814575#L25 assume !(~n <= 0); 814407#L26 call #t~ret0 := fact(~n - 1);< 814481#factENTRY ~n := #in~n; 814522#L25 assume !(~n <= 0); 814404#L26 call #t~ret0 := fact(~n - 1);< 814455#factENTRY ~n := #in~n; 814509#L25 assume !(~n <= 0); 814410#L26 call #t~ret0 := fact(~n - 1);< 814507#factENTRY ~n := #in~n; 814510#L25 assume ~n <= 0;#res := 1; 814508#factFINAL assume true; 814506#factEXIT >#66#return; 814505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814504#factFINAL assume true; 814500#factEXIT >#66#return; 814498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814487#factFINAL assume true; 814479#factEXIT >#66#return; 814414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 814871#factFINAL assume true; 813750#factEXIT >#78#return; 813741#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; 813738#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 813735#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 813707#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 813705#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; 813697#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813698#factENTRY ~n := #in~n; 813716#L25 assume !(~n <= 0); 813712#L26 call #t~ret0 := fact(~n - 1);< 813714#factENTRY ~n := #in~n; 813721#L25 assume !(~n <= 0); 813713#L26 call #t~ret0 := fact(~n - 1);< 813719#factENTRY ~n := #in~n; 813721#L25 assume !(~n <= 0); 813713#L26 call #t~ret0 := fact(~n - 1);< 813719#factENTRY ~n := #in~n; 813721#L25 assume !(~n <= 0); 813713#L26 call #t~ret0 := fact(~n - 1);< 813719#factENTRY ~n := #in~n; 813721#L25 assume !(~n <= 0); 813713#L26 call #t~ret0 := fact(~n - 1);< 813719#factENTRY ~n := #in~n; 813721#L25 assume !(~n <= 0); 813713#L26 call #t~ret0 := fact(~n - 1);< 813719#factENTRY ~n := #in~n; 813734#L25 assume ~n <= 0;#res := 1; 813733#factFINAL assume true; 813732#factEXIT >#66#return; 813731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813730#factFINAL assume true; 813729#factEXIT >#66#return; 813728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813727#factFINAL assume true; 813726#factEXIT >#66#return; 813725#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813724#factFINAL assume true; 813723#factEXIT >#66#return; 813722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813720#factFINAL assume true; 813718#factEXIT >#66#return; 813717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813715#factFINAL assume true; 813711#factEXIT >#66#return; 813710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813701#factFINAL assume true; 813696#factEXIT >#74#return; 813686#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813688#factENTRY ~n := #in~n; 813692#L25 assume ~n <= 0;#res := 1; 813691#factFINAL assume true; 813684#factEXIT >#76#return; 813658#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 813681#factENTRY ~n := #in~n; 813679#L25 assume !(~n <= 0); 813575#L26 call #t~ret0 := fact(~n - 1);< 813659#factENTRY ~n := #in~n; 813708#L25 assume !(~n <= 0); 813576#L26 call #t~ret0 := fact(~n - 1);< 813673#factENTRY ~n := #in~n; 813709#L25 assume !(~n <= 0); 813567#L26 call #t~ret0 := fact(~n - 1);< 813645#factENTRY ~n := #in~n; 813703#L25 assume !(~n <= 0); 813564#L26 call #t~ret0 := fact(~n - 1);< 813690#factENTRY ~n := #in~n; 813703#L25 assume !(~n <= 0); 813564#L26 call #t~ret0 := fact(~n - 1);< 813690#factENTRY ~n := #in~n; 813703#L25 assume !(~n <= 0); 813564#L26 call #t~ret0 := fact(~n - 1);< 813690#factENTRY ~n := #in~n; 813703#L25 assume !(~n <= 0); 813564#L26 call #t~ret0 := fact(~n - 1);< 813690#factENTRY ~n := #in~n; 813704#L25 assume ~n <= 0;#res := 1; 813702#factFINAL assume true; 813689#factEXIT >#66#return; 813683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813682#factFINAL assume true; 813680#factEXIT >#66#return; 813676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813674#factFINAL assume true; 813671#factEXIT >#66#return; 813669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813668#factFINAL assume true; 813667#factEXIT >#66#return; 813666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813665#factFINAL assume true; 813663#factEXIT >#66#return; 813661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813657#factFINAL assume true; 813653#factEXIT >#66#return; 813621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813622#factFINAL assume true; 813610#factEXIT >#66#return; 813595#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813838#factFINAL assume true; 813831#factEXIT >#78#return; 813537#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; 813536#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 813535#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 813534#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 813533#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 813532#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 813531#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 813519#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; 813509#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813510#factENTRY ~n := #in~n; 813528#L25 assume !(~n <= 0); 813525#L26 call #t~ret0 := fact(~n - 1);< 813526#factENTRY ~n := #in~n; 813529#L25 assume ~n <= 0;#res := 1; 813527#factFINAL assume true; 813524#factEXIT >#66#return; 813521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813518#factFINAL assume true; 813508#factEXIT >#68#return; 813403#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813504#factENTRY ~n := #in~n; 813517#L25 assume ~n <= 0;#res := 1; 813507#factFINAL assume true; 813375#factEXIT >#70#return; 813371#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 813372#factENTRY ~n := #in~n; 813516#L25 assume !(~n <= 0); 813512#L26 call #t~ret0 := fact(~n - 1);< 813515#factENTRY ~n := #in~n; 813522#L25 assume ~n <= 0;#res := 1; 813520#factFINAL assume true; 813511#factEXIT >#66#return; 813506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 813374#factFINAL assume true; 813370#factEXIT >#72#return; 813368#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; 813367#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 813366#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 813364#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 813362#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; 813278#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813279#factENTRY ~n := #in~n; 813523#L25 assume !(~n <= 0); 813513#L26 call #t~ret0 := fact(~n - 1);< 813515#factENTRY ~n := #in~n; 813522#L25 assume ~n <= 0;#res := 1; 813520#factFINAL assume true; 813511#factEXIT >#66#return; 813514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815745#factFINAL assume true; 815743#factEXIT >#68#return; 815740#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 815741#factENTRY ~n := #in~n; 815752#L25 assume !(~n <= 0); 815533#L26 call #t~ret0 := fact(~n - 1);< 815733#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815747#factFINAL assume true; 815739#factEXIT >#70#return; 815661#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815662#factENTRY ~n := #in~n; 815774#L25 assume ~n <= 0;#res := 1; 815738#factFINAL assume true; 815660#factEXIT >#72#return; 815658#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; 815656#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 815654#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 815652#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 815545#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; 815440#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815519#factENTRY ~n := #in~n; 815840#L25 assume !(~n <= 0); 815714#L26 call #t~ret0 := fact(~n - 1);< 815807#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815542#factFINAL assume true; 815438#factEXIT >#74#return; 815173#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 815435#factENTRY ~n := #in~n; 816207#L25 assume !(~n <= 0); 815532#L26 call #t~ret0 := fact(~n - 1);< 815541#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815434#factFINAL assume true; 815096#factEXIT >#76#return; 815220#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815432#factENTRY ~n := #in~n; 816204#L25 assume !(~n <= 0); 815532#L26 call #t~ret0 := fact(~n - 1);< 815541#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815434#factFINAL assume true; 815096#factEXIT >#78#return; 813292#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; 813293#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 817637#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 817633#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 817631#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; 817423#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 817425#factENTRY ~n := #in~n; 817536#L25 assume !(~n <= 0); 817518#L26 call #t~ret0 := fact(~n - 1);< 817531#factENTRY ~n := #in~n; 818300#L25 assume !(~n <= 0); 817521#L26 call #t~ret0 := fact(~n - 1);< 817566#factENTRY ~n := #in~n; 818300#L25 assume !(~n <= 0); 817521#L26 call #t~ret0 := fact(~n - 1);< 817566#factENTRY ~n := #in~n; 817573#L25 assume ~n <= 0;#res := 1; 817569#factFINAL assume true; 817563#factEXIT >#66#return; 817561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817555#factFINAL assume true; 817538#factEXIT >#66#return; 817537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817532#factFINAL assume true; 817513#factEXIT >#66#return; 817512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817510#factFINAL assume true; 817421#factEXIT >#74#return; 817404#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 817405#factENTRY ~n := #in~n; 818649#L25 assume !(~n <= 0); 818396#L26 call #t~ret0 := fact(~n - 1);< 818406#factENTRY ~n := #in~n; 818442#L25 assume ~n <= 0;#res := 1; 818409#factFINAL assume true; 818395#factEXIT >#66#return; 818402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 818648#factFINAL assume true; 818643#factEXIT >#76#return; 818644#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 819261#factENTRY ~n := #in~n; 819656#L25 assume !(~n <= 0); 819298#L26 call #t~ret0 := fact(~n - 1);< 819332#factENTRY ~n := #in~n; 818444#L25 assume !(~n <= 0); 819329#L26 call #t~ret0 := fact(~n - 1);< 819330#factENTRY ~n := #in~n; 819335#L25 assume ~n <= 0;#res := 1; 819333#factFINAL assume true; 819328#factEXIT >#66#return; 819327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819318#factFINAL assume true; 819284#factEXIT >#66#return; 819317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819702#factFINAL assume true; 819256#factEXIT >#78#return; 818321#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; 818320#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 818318#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 818311#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816973#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; 816884#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 816955#factENTRY ~n := #in~n; 816953#L25 assume !(~n <= 0); 816724#L26 call #t~ret0 := fact(~n - 1);< 816951#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816971#L25 assume ~n <= 0;#res := 1; 816942#factFINAL assume true; 816916#factEXIT >#66#return; 816867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816857#factFINAL assume true; 816836#factEXIT >#66#return; 816820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816810#factFINAL assume true; 816790#factEXIT >#66#return; 816788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816782#factFINAL assume true; 816766#factEXIT >#66#return; 816765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816760#factFINAL assume true; 816745#factEXIT >#66#return; 816744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816739#factFINAL assume true; 816707#factEXIT >#66#return; 816734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817339#factFINAL assume true; 816925#factEXIT >#66#return; 816926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817051#factFINAL assume true; 817043#factEXIT >#66#return; 817042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817036#factFINAL assume true; 817032#factEXIT >#66#return; 817034#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817005#factFINAL assume true; 816998#factEXIT >#74#return; 816885#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 816893#factENTRY ~n := #in~n; 817048#L25 assume !(~n <= 0); 816660#L26 call #t~ret0 := fact(~n - 1);< 816665#factENTRY ~n := #in~n; 816670#L25 assume ~n <= 0;#res := 1; 816666#factFINAL assume true; 816656#factEXIT >#66#return; 816664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817062#factFINAL assume true; 816977#factEXIT >#76#return; 816957#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 817055#factENTRY ~n := #in~n; 817054#L25 assume !(~n <= 0); 813299#L26 call #t~ret0 := fact(~n - 1);< 817047#factENTRY ~n := #in~n; 817337#L25 assume !(~n <= 0); 813296#L26 call #t~ret0 := fact(~n - 1);< 813298#factENTRY ~n := #in~n; 816834#L25 assume !(~n <= 0); 816710#L26 call #t~ret0 := fact(~n - 1);< 816819#factENTRY ~n := #in~n; 816809#L25 assume !(~n <= 0); 816747#L26 call #t~ret0 := fact(~n - 1);< 816759#factENTRY ~n := #in~n; 820283#L25 assume !(~n <= 0); 816768#L26 call #t~ret0 := fact(~n - 1);< 816778#factENTRY ~n := #in~n; 816871#L25 assume !(~n <= 0); 816793#L26 call #t~ret0 := fact(~n - 1);< 816807#factENTRY ~n := #in~n; 817238#L25 assume !(~n <= 0); 816838#L26 call #t~ret0 := fact(~n - 1);< 816852#factENTRY ~n := #in~n; 816671#L25 assume !(~n <= 0); 816917#L26 call #t~ret0 := fact(~n - 1);< 816918#factENTRY ~n := #in~n; 816971#L25 assume ~n <= 0;#res := 1; 816942#factFINAL assume true; 816916#factEXIT >#66#return; 816867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816857#factFINAL assume true; 816836#factEXIT >#66#return; 816820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816810#factFINAL assume true; 816790#factEXIT >#66#return; 816788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816782#factFINAL assume true; 816766#factEXIT >#66#return; 816765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816760#factFINAL assume true; 816745#factEXIT >#66#return; 816744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816739#factFINAL assume true; 816707#factEXIT >#66#return; 816734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817339#factFINAL assume true; 816925#factEXIT >#66#return; 816926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817051#factFINAL assume true; 817043#factEXIT >#66#return; 817044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817079#factFINAL assume true; 816956#factEXIT >#78#return; 816287#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; 816284#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 816220#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 816219#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 816216#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 816208#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 816202#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 815891#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; 815886#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815887#factENTRY ~n := #in~n; 815910#L25 assume !(~n <= 0); 815903#L26 call #t~ret0 := fact(~n - 1);< 815906#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 815925#L25 assume ~n <= 0;#res := 1; 815951#factFINAL assume true; 815937#factEXIT >#66#return; 815924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815908#factFINAL assume true; 815901#factEXIT >#66#return; 815898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815890#factFINAL assume true; 815885#factEXIT >#68#return; 813384#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813504#factENTRY ~n := #in~n; 813517#L25 assume ~n <= 0;#res := 1; 813507#factFINAL assume true; 813375#factEXIT >#70#return; 813448#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815877#factENTRY ~n := #in~n; 815897#L25 assume !(~n <= 0); 815706#L26 call #t~ret0 := fact(~n - 1);< 815889#factENTRY ~n := #in~n; 816177#L25 assume !(~n <= 0); 815707#L26 call #t~ret0 := fact(~n - 1);< 815800#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815882#factFINAL assume true; 815876#factEXIT >#72#return; 815775#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; 815771#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 815770#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 815769#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 815765#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; 815439#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815543#factENTRY ~n := #in~n; 816183#L25 assume !(~n <= 0); 815724#L26 call #t~ret0 := fact(~n - 1);< 815734#factENTRY ~n := #in~n; 816180#L25 assume !(~n <= 0); 815799#L26 call #t~ret0 := fact(~n - 1);< 815801#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815542#factFINAL assume true; 815438#factEXIT >#68#return; 815321#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 815697#factENTRY ~n := #in~n; 816041#L25 assume !(~n <= 0); 815529#L26 call #t~ret0 := fact(~n - 1);< 815733#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815434#factFINAL assume true; 815096#factEXIT >#70#return; 815415#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815762#factENTRY ~n := #in~n; 815986#L25 assume !(~n <= 0); 815527#L26 call #t~ret0 := fact(~n - 1);< 815541#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815763#factFINAL assume true; 815753#factEXIT >#72#return; 815751#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; 815750#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 815749#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 815748#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 815746#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; 815441#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815543#factENTRY ~n := #in~n; 816183#L25 assume !(~n <= 0); 815724#L26 call #t~ret0 := fact(~n - 1);< 815734#factENTRY ~n := #in~n; 816180#L25 assume !(~n <= 0); 815799#L26 call #t~ret0 := fact(~n - 1);< 815801#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815542#factFINAL assume true; 815438#factEXIT >#68#return; 815322#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 815697#factENTRY ~n := #in~n; 816041#L25 assume !(~n <= 0); 815529#L26 call #t~ret0 := fact(~n - 1);< 815733#factENTRY ~n := #in~n; 816180#L25 assume !(~n <= 0); 815799#L26 call #t~ret0 := fact(~n - 1);< 815801#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815542#factFINAL assume true; 815438#factEXIT >#70#return; 815517#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815696#factENTRY ~n := #in~n; 815744#L25 assume ~n <= 0;#res := 1; 815742#factFINAL assume true; 815665#factEXIT >#72#return; 815663#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; 815659#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 815657#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 815655#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 815653#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; 815603#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815651#factENTRY ~n := #in~n; 815820#L25 assume !(~n <= 0); 815709#L26 call #t~ret0 := fact(~n - 1);< 815807#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815772#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815735#factFINAL assume true; 815548#factEXIT >#74#return; 815442#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 815544#factENTRY ~n := #in~n; 816181#L25 assume !(~n <= 0); 815521#L26 call #t~ret0 := fact(~n - 1);< 815733#factENTRY ~n := #in~n; 816180#L25 assume !(~n <= 0); 815799#L26 call #t~ret0 := fact(~n - 1);< 815801#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815542#factFINAL assume true; 815438#factEXIT >#76#return; 815336#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815436#factENTRY ~n := #in~n; 816182#L25 assume !(~n <= 0); 815528#L26 call #t~ret0 := fact(~n - 1);< 815733#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815434#factFINAL assume true; 815096#factEXIT >#78#return; 815431#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; 817300#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 817301#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 817791#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816680#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; 816681#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 817425#factENTRY ~n := #in~n; 817536#L25 assume !(~n <= 0); 817518#L26 call #t~ret0 := fact(~n - 1);< 817531#factENTRY ~n := #in~n; 818300#L25 assume !(~n <= 0); 817521#L26 call #t~ret0 := fact(~n - 1);< 817566#factENTRY ~n := #in~n; 818300#L25 assume !(~n <= 0); 817521#L26 call #t~ret0 := fact(~n - 1);< 817566#factENTRY ~n := #in~n; 817573#L25 assume ~n <= 0;#res := 1; 817569#factFINAL assume true; 817563#factEXIT >#66#return; 817561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817555#factFINAL assume true; 817538#factEXIT >#66#return; 817537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817532#factFINAL assume true; 817513#factEXIT >#66#return; 817512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817510#factFINAL assume true; 817421#factEXIT >#74#return; 817403#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 817405#factENTRY ~n := #in~n; 818649#L25 assume !(~n <= 0); 818396#L26 call #t~ret0 := fact(~n - 1);< 818406#factENTRY ~n := #in~n; 818444#L25 assume !(~n <= 0); 819329#L26 call #t~ret0 := fact(~n - 1);< 819330#factENTRY ~n := #in~n; 819335#L25 assume ~n <= 0;#res := 1; 819333#factFINAL assume true; 819328#factEXIT >#66#return; 819327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819318#factFINAL assume true; 819284#factEXIT >#66#return; 819311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819326#factFINAL assume true; 819325#factEXIT >#76#return; 819257#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 819261#factENTRY ~n := #in~n; 819656#L25 assume !(~n <= 0); 819298#L26 call #t~ret0 := fact(~n - 1);< 819332#factENTRY ~n := #in~n; 818444#L25 assume !(~n <= 0); 819329#L26 call #t~ret0 := fact(~n - 1);< 819330#factENTRY ~n := #in~n; 819335#L25 assume ~n <= 0;#res := 1; 819333#factFINAL assume true; 819328#factEXIT >#66#return; 819327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819318#factFINAL assume true; 819284#factEXIT >#66#return; 819317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819702#factFINAL assume true; 819256#factEXIT >#78#return; 818325#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; 819246#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 819245#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 819244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816999#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; 816939#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813258#factENTRY ~n := #in~n; 816954#L25 assume !(~n <= 0); 816723#L26 call #t~ret0 := fact(~n - 1);< 816951#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816971#L25 assume ~n <= 0;#res := 1; 816942#factFINAL assume true; 816916#factEXIT >#66#return; 816867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816857#factFINAL assume true; 816836#factEXIT >#66#return; 816820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816810#factFINAL assume true; 816790#factEXIT >#66#return; 816788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816782#factFINAL assume true; 816766#factEXIT >#66#return; 816765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816760#factFINAL assume true; 816745#factEXIT >#66#return; 816744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816739#factFINAL assume true; 816707#factEXIT >#66#return; 816734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817339#factFINAL assume true; 816925#factEXIT >#66#return; 816926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817051#factFINAL assume true; 817043#factEXIT >#66#return; 817042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817036#factFINAL assume true; 817032#factEXIT >#66#return; 817031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817020#factFINAL assume true; 817014#factEXIT >#66#return; 817015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816975#factFINAL assume true; 816935#factEXIT >#74#return; 816881#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 816893#factENTRY ~n := #in~n; 817048#L25 assume !(~n <= 0); 816660#L26 call #t~ret0 := fact(~n - 1);< 816665#factENTRY ~n := #in~n; 816671#L25 assume !(~n <= 0); 816917#L26 call #t~ret0 := fact(~n - 1);< 816918#factENTRY ~n := #in~n; 816971#L25 assume ~n <= 0;#res := 1; 816942#factFINAL assume true; 816916#factEXIT >#66#return; 816867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816857#factFINAL assume true; 816836#factEXIT >#66#return; 816843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816934#factFINAL assume true; 816875#factEXIT >#76#return; 816861#L30-7 [2022-11-18 20:35:20,202 INFO L750 eck$LassoCheckResult]: Loop: 816861#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 816873#factENTRY ~n := #in~n; 816872#L25 assume !(~n <= 0); 816740#L26 call #t~ret0 := fact(~n - 1);< 816856#factENTRY ~n := #in~n; 816835#L25 assume !(~n <= 0); 816729#L26 call #t~ret0 := fact(~n - 1);< 816738#factENTRY ~n := #in~n; 817087#L25 assume !(~n <= 0); 813284#L26 call #t~ret0 := fact(~n - 1);< 813283#factENTRY ~n := #in~n; 813285#L25 assume !(~n <= 0); 816722#L26 call #t~ret0 := fact(~n - 1);< 816779#factENTRY ~n := #in~n; 817229#L25 assume !(~n <= 0); 816750#L26 call #t~ret0 := fact(~n - 1);< 816805#factENTRY ~n := #in~n; 817318#L25 assume !(~n <= 0); 816767#L26 call #t~ret0 := fact(~n - 1);< 816850#factENTRY ~n := #in~n; 816950#L25 assume !(~n <= 0); 816797#L26 call #t~ret0 := fact(~n - 1);< 816922#factENTRY ~n := #in~n; 816952#L25 assume !(~n <= 0); 816839#L26 call #t~ret0 := fact(~n - 1);< 816923#factENTRY ~n := #in~n; 816971#L25 assume ~n <= 0;#res := 1; 816942#factFINAL assume true; 816916#factEXIT >#66#return; 816867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816857#factFINAL assume true; 816836#factEXIT >#66#return; 816820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816810#factFINAL assume true; 816790#factEXIT >#66#return; 816788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816782#factFINAL assume true; 816766#factEXIT >#66#return; 816765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816760#factFINAL assume true; 816745#factEXIT >#66#return; 816744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816739#factFINAL assume true; 816707#factEXIT >#66#return; 816734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817339#factFINAL assume true; 816925#factEXIT >#66#return; 816926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817051#factFINAL assume true; 817043#factEXIT >#66#return; 817044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817079#factFINAL assume true; 816956#factEXIT >#78#return; 816619#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; 816618#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 816617#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 816616#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 816615#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 816614#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 816613#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816536#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; 815929#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813277#factENTRY ~n := #in~n; 815934#L25 assume !(~n <= 0); 815904#L26 call #t~ret0 := fact(~n - 1);< 815906#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 813530#L25 assume !(~n <= 0); 815902#L26 call #t~ret0 := fact(~n - 1);< 815909#factENTRY ~n := #in~n; 815925#L25 assume ~n <= 0;#res := 1; 815951#factFINAL assume true; 815937#factEXIT >#66#return; 815924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815908#factFINAL assume true; 815901#factEXIT >#66#return; 815905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816437#factFINAL assume true; 816435#factEXIT >#66#return; 816434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816433#factFINAL assume true; 816431#factEXIT >#66#return; 816430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816429#factFINAL assume true; 816427#factEXIT >#66#return; 816426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816425#factFINAL assume true; 816423#factEXIT >#66#return; 816422#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816421#factFINAL assume true; 816419#factEXIT >#66#return; 816418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816417#factFINAL assume true; 816415#factEXIT >#66#return; 816416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816451#factFINAL assume true; 816449#factEXIT >#66#return; 816448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816447#factFINAL assume true; 816445#factEXIT >#66#return; 816444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816443#factFINAL assume true; 816441#factEXIT >#66#return; 816442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816470#factFINAL assume true; 816466#factEXIT >#66#return; 816467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816473#factFINAL assume true; 816472#factEXIT >#66#return; 816471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816468#factFINAL assume true; 816457#factEXIT >#68#return; 813420#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813504#factENTRY ~n := #in~n; 813517#L25 assume ~n <= 0;#res := 1; 813507#factFINAL assume true; 813375#factEXIT >#70#return; 813483#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 816178#factENTRY ~n := #in~n; 816179#L25 assume !(~n <= 0); 815860#L26 call #t~ret0 := fact(~n - 1);< 815875#factENTRY ~n := #in~n; 816539#L25 assume !(~n <= 0); 815854#L26 call #t~ret0 := fact(~n - 1);< 815874#factENTRY ~n := #in~n; 816197#L25 assume !(~n <= 0); 815852#L26 call #t~ret0 := fact(~n - 1);< 815896#factENTRY ~n := #in~n; 816221#L25 assume !(~n <= 0); 815864#L26 call #t~ret0 := fact(~n - 1);< 815923#factENTRY ~n := #in~n; 816390#L25 assume !(~n <= 0); 815857#L26 call #t~ret0 := fact(~n - 1);< 815948#factENTRY ~n := #in~n; 816241#L25 assume !(~n <= 0); 815861#L26 call #t~ret0 := fact(~n - 1);< 815981#factENTRY ~n := #in~n; 816191#L25 assume !(~n <= 0); 815858#L26 call #t~ret0 := fact(~n - 1);< 816013#factENTRY ~n := #in~n; 816292#L25 assume !(~n <= 0); 815859#L26 call #t~ret0 := fact(~n - 1);< 816061#factENTRY ~n := #in~n; 816043#L25 assume !(~n <= 0); 815867#L26 call #t~ret0 := fact(~n - 1);< 816042#factENTRY ~n := #in~n; 816040#L25 assume !(~n <= 0); 815862#L26 call #t~ret0 := fact(~n - 1);< 816039#factENTRY ~n := #in~n; 815985#L25 assume !(~n <= 0); 815767#L26 call #t~ret0 := fact(~n - 1);< 815968#factENTRY ~n := #in~n; 816032#L25 assume !(~n <= 0); 815726#L26 call #t~ret0 := fact(~n - 1);< 815768#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815794#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816140#factFINAL assume true; 816129#factEXIT >#66#return; 816128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816115#factFINAL assume true; 816095#factEXIT >#66#return; 816094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816074#factFINAL assume true; 816049#factEXIT >#66#return; 816047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816020#factFINAL assume true; 816005#factEXIT >#66#return; 816002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815998#factFINAL assume true; 815970#factEXIT >#66#return; 815962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815952#factFINAL assume true; 815938#factEXIT >#66#return; 815935#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815931#factFINAL assume true; 815911#factEXIT >#66#return; 815907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815899#factFINAL assume true; 815892#factEXIT >#66#return; 815888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815883#factFINAL assume true; 815878#factEXIT >#66#return; 815871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815873#factFINAL assume true; 815851#factEXIT >#66#return; 815872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816410#factFINAL assume true; 816407#factEXIT >#72#return; 816399#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; 820138#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 820137#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 820136#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 820135#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; 815556#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815651#factENTRY ~n := #in~n; 815820#L25 assume !(~n <= 0); 815709#L26 call #t~ret0 := fact(~n - 1);< 815807#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815794#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816140#factFINAL assume true; 816129#factEXIT >#66#return; 816128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816115#factFINAL assume true; 816095#factEXIT >#66#return; 816094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816074#factFINAL assume true; 816049#factEXIT >#66#return; 816047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816020#factFINAL assume true; 816005#factEXIT >#66#return; 816002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815998#factFINAL assume true; 815970#factEXIT >#66#return; 815962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815952#factFINAL assume true; 815938#factEXIT >#66#return; 815935#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815931#factFINAL assume true; 815911#factEXIT >#66#return; 815907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815899#factFINAL assume true; 815892#factEXIT >#66#return; 815893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816383#factFINAL assume true; 816110#factEXIT >#68#return; 815180#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813342#factENTRY ~n := #in~n; 816107#L25 assume !(~n <= 0); 815531#L26 call #t~ret0 := fact(~n - 1);< 815806#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815434#factFINAL assume true; 815096#factEXIT >#70#return; 815404#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 816365#factENTRY ~n := #in~n; 816203#L25 assume !(~n <= 0); 815853#L26 call #t~ret0 := fact(~n - 1);< 815933#factENTRY ~n := #in~n; 816390#L25 assume !(~n <= 0); 815857#L26 call #t~ret0 := fact(~n - 1);< 815948#factENTRY ~n := #in~n; 816241#L25 assume !(~n <= 0); 815861#L26 call #t~ret0 := fact(~n - 1);< 815981#factENTRY ~n := #in~n; 816191#L25 assume !(~n <= 0); 815858#L26 call #t~ret0 := fact(~n - 1);< 816013#factENTRY ~n := #in~n; 816292#L25 assume !(~n <= 0); 815859#L26 call #t~ret0 := fact(~n - 1);< 816061#factENTRY ~n := #in~n; 816043#L25 assume !(~n <= 0); 815867#L26 call #t~ret0 := fact(~n - 1);< 816042#factENTRY ~n := #in~n; 816040#L25 assume !(~n <= 0); 815862#L26 call #t~ret0 := fact(~n - 1);< 816039#factENTRY ~n := #in~n; 815985#L25 assume !(~n <= 0); 815767#L26 call #t~ret0 := fact(~n - 1);< 815968#factENTRY ~n := #in~n; 816032#L25 assume !(~n <= 0); 815726#L26 call #t~ret0 := fact(~n - 1);< 815768#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815794#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816140#factFINAL assume true; 816129#factEXIT >#66#return; 816128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816115#factFINAL assume true; 816095#factEXIT >#66#return; 816094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816074#factFINAL assume true; 816049#factEXIT >#66#return; 816047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816020#factFINAL assume true; 816005#factEXIT >#66#return; 816002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815998#factFINAL assume true; 815970#factEXIT >#66#return; 815962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815952#factFINAL assume true; 815938#factEXIT >#66#return; 815935#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815931#factFINAL assume true; 815911#factEXIT >#66#return; 815907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815899#factFINAL assume true; 815892#factEXIT >#66#return; 815888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815883#factFINAL assume true; 815878#factEXIT >#66#return; 815871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815873#factFINAL assume true; 815851#factEXIT >#66#return; 815870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816376#factFINAL assume true; 816364#factEXIT >#72#return; 816324#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; 816546#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 816545#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 816544#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816540#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; 815583#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815651#factENTRY ~n := #in~n; 815820#L25 assume !(~n <= 0); 815709#L26 call #t~ret0 := fact(~n - 1);< 815807#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815772#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815735#factFINAL assume true; 815548#factEXIT >#68#return; 815276#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 813342#factENTRY ~n := #in~n; 816107#L25 assume !(~n <= 0); 815531#L26 call #t~ret0 := fact(~n - 1);< 815806#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815542#factFINAL assume true; 815438#factEXIT >#70#return; 815508#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 816069#factENTRY ~n := #in~n; 816068#L25 assume !(~n <= 0); 815535#L26 call #t~ret0 := fact(~n - 1);< 815733#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815763#factFINAL assume true; 815753#factEXIT >#72#return; 815760#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; 816249#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 816250#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 816245#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816246#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; 815605#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815736#factENTRY ~n := #in~n; 816090#L25 assume !(~n <= 0); 815777#L26 call #t~ret0 := fact(~n - 1);< 816028#factENTRY ~n := #in~n; 816160#L25 assume !(~n <= 0); 815705#L26 call #t~ret0 := fact(~n - 1);< 816059#factENTRY ~n := #in~n; 816127#L25 assume !(~n <= 0); 815725#L26 call #t~ret0 := fact(~n - 1);< 816106#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815772#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815735#factFINAL assume true; 815548#factEXIT >#68#return; 815117#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 815826#factENTRY ~n := #in~n; 815823#L25 assume !(~n <= 0); 815530#L26 call #t~ret0 := fact(~n - 1);< 815796#factENTRY ~n := #in~n; 816112#L25 assume !(~n <= 0); 815717#L26 call #t~ret0 := fact(~n - 1);< 815800#factENTRY ~n := #in~n; 816180#L25 assume !(~n <= 0); 815799#L26 call #t~ret0 := fact(~n - 1);< 815801#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815772#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815735#factFINAL assume true; 815548#factEXIT >#70#return; 815614#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815696#factENTRY ~n := #in~n; 815744#L25 assume ~n <= 0;#res := 1; 815742#factFINAL assume true; 815665#factEXIT >#72#return; 815692#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; 816236#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 816237#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 816225#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816226#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; 815808#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 815842#factENTRY ~n := #in~n; 815827#L25 assume !(~n <= 0); 815699#L26 call #t~ret0 := fact(~n - 1);< 815807#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815804#L25 assume !(~n <= 0); 815711#L26 call #t~ret0 := fact(~n - 1);< 815802#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815794#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816140#factFINAL assume true; 816129#factEXIT >#66#return; 816128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816115#factFINAL assume true; 816095#factEXIT >#66#return; 816100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816537#factFINAL assume true; 815829#factEXIT >#74#return; 815571#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 816045#factENTRY ~n := #in~n; 816044#L25 assume !(~n <= 0); 815783#L26 call #t~ret0 := fact(~n - 1);< 815994#factENTRY ~n := #in~n; 815993#L25 assume !(~n <= 0); 815704#L26 call #t~ret0 := fact(~n - 1);< 815734#factENTRY ~n := #in~n; 816180#L25 assume !(~n <= 0); 815799#L26 call #t~ret0 := fact(~n - 1);< 815801#factENTRY ~n := #in~n; 815805#L25 assume ~n <= 0;#res := 1; 815803#factFINAL assume true; 815798#factEXIT >#66#return; 815773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815766#factFINAL assume true; 815698#factEXIT >#66#return; 815731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815963#factFINAL assume true; 815776#factEXIT >#66#return; 815772#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815735#factFINAL assume true; 815548#factEXIT >#76#return; 815208#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 815436#factENTRY ~n := #in~n; 816182#L25 assume !(~n <= 0); 815528#L26 call #t~ret0 := fact(~n - 1);< 815733#factENTRY ~n := #in~n; 815664#L25 assume ~n <= 0;#res := 1; 815546#factFINAL assume true; 815520#factEXIT >#66#return; 815437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 815434#factFINAL assume true; 815096#factEXIT >#78#return; 815417#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; 820117#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 820116#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 820115#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 820114#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; 817455#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 817468#factENTRY ~n := #in~n; 820140#L25 assume !(~n <= 0); 819755#L26 call #t~ret0 := fact(~n - 1);< 819817#factENTRY ~n := #in~n; 820010#L25 assume !(~n <= 0); 819735#L26 call #t~ret0 := fact(~n - 1);< 820000#factENTRY ~n := #in~n; 820010#L25 assume !(~n <= 0); 819735#L26 call #t~ret0 := fact(~n - 1);< 820000#factENTRY ~n := #in~n; 820010#L25 assume !(~n <= 0); 819735#L26 call #t~ret0 := fact(~n - 1);< 820000#factENTRY ~n := #in~n; 819900#L25 assume ~n <= 0;#res := 1; 819899#factFINAL assume true; 819866#factEXIT >#66#return; 819865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819856#factFINAL assume true; 819833#factEXIT >#66#return; 819832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819827#factFINAL assume true; 819787#factEXIT >#66#return; 819799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819818#factFINAL assume true; 819806#factEXIT >#66#return; 819733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 818305#factFINAL assume true; 818306#factEXIT >#74#return; 817467#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 818749#factENTRY ~n := #in~n; 819655#L25 assume !(~n <= 0); 819434#L26 call #t~ret0 := fact(~n - 1);< 819449#factENTRY ~n := #in~n; 819582#L25 assume !(~n <= 0); 819291#L26 call #t~ret0 := fact(~n - 1);< 819332#factENTRY ~n := #in~n; 818444#L25 assume !(~n <= 0); 819329#L26 call #t~ret0 := fact(~n - 1);< 819330#factENTRY ~n := #in~n; 819335#L25 assume ~n <= 0;#res := 1; 819333#factFINAL assume true; 819328#factEXIT >#66#return; 819327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819318#factFINAL assume true; 819284#factEXIT >#66#return; 819309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819468#factFINAL assume true; 819433#factEXIT >#66#return; 819443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819669#factFINAL assume true; 819668#factEXIT >#76#return; 819657#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 819658#factENTRY ~n := #in~n; 819709#L25 assume !(~n <= 0); 819306#L26 call #t~ret0 := fact(~n - 1);< 819332#factENTRY ~n := #in~n; 818444#L25 assume !(~n <= 0); 819329#L26 call #t~ret0 := fact(~n - 1);< 819330#factENTRY ~n := #in~n; 819335#L25 assume ~n <= 0;#res := 1; 819333#factFINAL assume true; 819328#factEXIT >#66#return; 819327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819318#factFINAL assume true; 819284#factEXIT >#66#return; 819316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 819707#factFINAL assume true; 819689#factEXIT >#78#return; 817356#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; 817350#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 817344#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 817338#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 816944#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; 816936#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 813258#factENTRY ~n := #in~n; 816954#L25 assume !(~n <= 0); 816723#L26 call #t~ret0 := fact(~n - 1);< 816951#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816949#L25 assume !(~n <= 0); 816721#L26 call #t~ret0 := fact(~n - 1);< 816921#factENTRY ~n := #in~n; 816971#L25 assume ~n <= 0;#res := 1; 816942#factFINAL assume true; 816916#factEXIT >#66#return; 816867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816857#factFINAL assume true; 816836#factEXIT >#66#return; 816820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816810#factFINAL assume true; 816790#factEXIT >#66#return; 816788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816782#factFINAL assume true; 816766#factEXIT >#66#return; 816765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816760#factFINAL assume true; 816745#factEXIT >#66#return; 816744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816739#factFINAL assume true; 816707#factEXIT >#66#return; 816734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817339#factFINAL assume true; 816925#factEXIT >#66#return; 816926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817051#factFINAL assume true; 817043#factEXIT >#66#return; 817042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817036#factFINAL assume true; 817032#factEXIT >#66#return; 817031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817020#factFINAL assume true; 817014#factEXIT >#66#return; 817013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 817011#factFINAL assume true; 817009#factEXIT >#66#return; 817010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816969#factFINAL assume true; 816943#factEXIT >#74#return; 816906#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 816931#factENTRY ~n := #in~n; 816946#L25 assume !(~n <= 0); 816796#L26 call #t~ret0 := fact(~n - 1);< 816807#factENTRY ~n := #in~n; 817238#L25 assume !(~n <= 0); 816838#L26 call #t~ret0 := fact(~n - 1);< 816852#factENTRY ~n := #in~n; 816671#L25 assume !(~n <= 0); 816917#L26 call #t~ret0 := fact(~n - 1);< 816918#factENTRY ~n := #in~n; 816971#L25 assume ~n <= 0;#res := 1; 816942#factFINAL assume true; 816916#factEXIT >#66#return; 816867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816857#factFINAL assume true; 816836#factEXIT >#66#return; 816820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816810#factFINAL assume true; 816790#factEXIT >#66#return; 816801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 816932#factFINAL assume true; 816894#factEXIT >#76#return; 816861#L30-7 [2022-11-18 20:35:20,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash -744502052, now seen corresponding path program 56 times [2022-11-18 20:35:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:20,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743884242] [2022-11-18 20:35:20,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:20,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:35:20,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683871799] [2022-11-18 20:35:20,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:35:20,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:20,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:20,263 INFO L229 MonitoredProcess]: Starting monitored process 323 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:20,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (323)] Waiting until timeout for monitored process [2022-11-18 20:35:22,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:35:22,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:22,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 1954 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:35:22,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 48877 backedges. 17201 proven. 63 refuted. 0 times theorem prover too weak. 31613 trivial. 0 not checked. [2022-11-18 20:35:22,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 48877 backedges. 825 proven. 2489 refuted. 0 times theorem prover too weak. 45563 trivial. 0 not checked. [2022-11-18 20:35:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743884242] [2022-11-18 20:35:24,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:35:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683871799] [2022-11-18 20:35:24,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683871799] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:24,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:24,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 19 [2022-11-18 20:35:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009118445] [2022-11-18 20:35:24,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:24,426 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:35:24,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1358978857, now seen corresponding path program 40 times [2022-11-18 20:35:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:24,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430368928] [2022-11-18 20:35:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:24,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:35:24,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434419724] [2022-11-18 20:35:24,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:35:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:24,463 INFO L229 MonitoredProcess]: Starting monitored process 324 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:24,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (324)] Waiting until timeout for monitored process [2022-11-18 20:35:26,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:35:26,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:26,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-18 20:35:26,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 41125 backedges. 22262 proven. 1890 refuted. 0 times theorem prover too weak. 16973 trivial. 0 not checked. [2022-11-18 20:35:27,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 41125 backedges. 2242 proven. 10489 refuted. 0 times theorem prover too weak. 28394 trivial. 0 not checked. [2022-11-18 20:35:46,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:46,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430368928] [2022-11-18 20:35:46,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:35:46,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434419724] [2022-11-18 20:35:46,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434419724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:46,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:35:46,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 55] total 60 [2022-11-18 20:35:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807661315] [2022-11-18 20:35:46,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:46,655 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:35:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-18 20:35:46,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=3080, Unknown=0, NotChecked=0, Total=3540 [2022-11-18 20:35:46,657 INFO L87 Difference]: Start difference. First operand 7174 states and 15635 transitions. cyclomatic complexity: 8517 Second operand has 60 states, 56 states have (on average 2.5357142857142856) internal successors, (142), 60 states have internal predecessors, (142), 34 states have call successors, (49), 2 states have call predecessors, (49), 27 states have return successors, (70), 28 states have call predecessors, (70), 34 states have call successors, (70) [2022-11-18 20:35:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:59,428 INFO L93 Difference]: Finished difference Result 9767 states and 20725 transitions. [2022-11-18 20:35:59,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9767 states and 20725 transitions. [2022-11-18 20:35:59,531 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1485 [2022-11-18 20:35:59,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9767 states to 9189 states and 19367 transitions. [2022-11-18 20:35:59,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2979 [2022-11-18 20:35:59,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2979 [2022-11-18 20:35:59,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9189 states and 19367 transitions. [2022-11-18 20:35:59,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:35:59,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9189 states and 19367 transitions. [2022-11-18 20:35:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9189 states and 19367 transitions. [2022-11-18 20:35:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9189 to 7447. [2022-11-18 20:35:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7447 states, 4220 states have (on average 1.0390995260663507) internal successors, (4385), 4195 states have internal predecessors, (4385), 2448 states have call successors, (2539), 1002 states have call predecessors, (2539), 779 states have return successors, (9183), 2249 states have call predecessors, (9183), 2448 states have call successors, (9183) [2022-11-18 20:35:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7447 states to 7447 states and 16107 transitions. [2022-11-18 20:35:59,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7447 states and 16107 transitions. [2022-11-18 20:35:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-18 20:35:59,939 INFO L428 stractBuchiCegarLoop]: Abstraction has 7447 states and 16107 transitions. [2022-11-18 20:35:59,939 INFO L335 stractBuchiCegarLoop]: ======== Iteration 73 ============ [2022-11-18 20:35:59,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7447 states and 16107 transitions. [2022-11-18 20:35:59,979 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 1198 [2022-11-18 20:35:59,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:35:59,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:35:59,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [136, 136, 89, 89, 89, 89, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:35:59,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [88, 88, 67, 67, 67, 67, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:35:59,987 INFO L748 eck$LassoCheckResult]: Stem: 840282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 840258#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; 840259#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 840281#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; 840308#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 840319#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840317#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; 840315#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840316#factENTRY ~n := #in~n; 840324#L25 assume ~n <= 0;#res := 1; 840322#factFINAL assume true; 840314#factEXIT >#68#return; 840300#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 840301#factENTRY ~n := #in~n; 840320#L25 assume ~n <= 0;#res := 1; 840318#factFINAL assume true; 840313#factEXIT >#70#return; 840234#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 840235#factENTRY ~n := #in~n; 840456#L25 assume ~n <= 0;#res := 1; 840332#factFINAL assume true; 840328#factEXIT >#72#return; 840276#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; 840277#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 840279#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 840940#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840939#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; 840937#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840938#factENTRY ~n := #in~n; 840948#L25 assume !(~n <= 0); 840945#L26 call #t~ret0 := fact(~n - 1);< 840946#factENTRY ~n := #in~n; 840957#L25 assume ~n <= 0;#res := 1; 840956#factFINAL assume true; 840944#factEXIT >#66#return; 840943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840942#factFINAL assume true; 840936#factEXIT >#74#return; 840933#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 840934#factENTRY ~n := #in~n; 840960#L25 assume ~n <= 0;#res := 1; 840958#factFINAL assume true; 840932#factEXIT >#76#return; 840929#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 840930#factENTRY ~n := #in~n; 840953#L25 assume !(~n <= 0); 840951#L26 call #t~ret0 := fact(~n - 1);< 840952#factENTRY ~n := #in~n; 840955#L25 assume ~n <= 0;#res := 1; 840954#factFINAL assume true; 840950#factEXIT >#66#return; 840949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840947#factFINAL assume true; 840928#factEXIT >#78#return; 840925#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; 840922#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 840917#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 840911#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840905#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; 840893#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840894#factENTRY ~n := #in~n; 840921#L25 assume !(~n <= 0); 840914#L26 call #t~ret0 := fact(~n - 1);< 840916#factENTRY ~n := #in~n; 840963#L25 assume !(~n <= 0); 840915#L26 call #t~ret0 := fact(~n - 1);< 840962#factENTRY ~n := #in~n; 840965#L25 assume ~n <= 0;#res := 1; 840964#factFINAL assume true; 840961#factEXIT >#66#return; 840959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840920#factFINAL assume true; 840913#factEXIT >#66#return; 840910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840904#factFINAL assume true; 840892#factEXIT >#74#return; 840888#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 840889#factENTRY ~n := #in~n; 840902#L25 assume ~n <= 0;#res := 1; 840891#factFINAL assume true; 840887#factEXIT >#76#return; 840884#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 840885#factENTRY ~n := #in~n; 840903#L25 assume !(~n <= 0); 840896#L26 call #t~ret0 := fact(~n - 1);< 840901#factENTRY ~n := #in~n; 840935#L25 assume !(~n <= 0); 840898#L26 call #t~ret0 := fact(~n - 1);< 840919#factENTRY ~n := #in~n; 840927#L25 assume ~n <= 0;#res := 1; 840924#factFINAL assume true; 840918#factEXIT >#66#return; 840912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840906#factFINAL assume true; 840895#factEXIT >#66#return; 840890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840886#factFINAL assume true; 840883#factEXIT >#78#return; 840882#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; 840881#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 840880#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 840879#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840878#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; 840876#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840877#factENTRY ~n := #in~n; 840941#L25 assume !(~n <= 0); 840899#L26 call #t~ret0 := fact(~n - 1);< 840901#factENTRY ~n := #in~n; 840935#L25 assume !(~n <= 0); 840898#L26 call #t~ret0 := fact(~n - 1);< 840919#factENTRY ~n := #in~n; 840935#L25 assume !(~n <= 0); 840898#L26 call #t~ret0 := fact(~n - 1);< 840919#factENTRY ~n := #in~n; 840927#L25 assume ~n <= 0;#res := 1; 840924#factFINAL assume true; 840918#factEXIT >#66#return; 840912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840906#factFINAL assume true; 840895#factEXIT >#66#return; 840900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841038#factFINAL assume true; 841035#factEXIT >#66#return; 841037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841040#factFINAL assume true; 841023#factEXIT >#74#return; 840974#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841000#factENTRY ~n := #in~n; 841146#L25 assume ~n <= 0;#res := 1; 841145#factFINAL assume true; 841143#factEXIT >#76#return; 840826#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 841246#factENTRY ~n := #in~n; 841247#L25 assume !(~n <= 0); 841176#L26 call #t~ret0 := fact(~n - 1);< 841199#factENTRY ~n := #in~n; 841245#L25 assume !(~n <= 0); 841183#L26 call #t~ret0 := fact(~n - 1);< 841188#factENTRY ~n := #in~n; 841235#L25 assume !(~n <= 0); 841177#L26 call #t~ret0 := fact(~n - 1);< 841230#factENTRY ~n := #in~n; 841233#L25 assume ~n <= 0;#res := 1; 841232#factFINAL assume true; 841229#factEXIT >#66#return; 841226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841225#factFINAL assume true; 841208#factEXIT >#66#return; 841204#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841201#factFINAL assume true; 841196#factEXIT >#66#return; 841185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842039#factFINAL assume true; 840825#factEXIT >#78#return; 840822#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; 840815#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 840811#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 840807#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840707#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; 840677#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840678#factENTRY ~n := #in~n; 840728#L25 assume !(~n <= 0); 840520#L26 call #t~ret0 := fact(~n - 1);< 840727#factENTRY ~n := #in~n; 840618#L25 assume !(~n <= 0); 840521#L26 call #t~ret0 := fact(~n - 1);< 840565#factENTRY ~n := #in~n; 840618#L25 assume !(~n <= 0); 840521#L26 call #t~ret0 := fact(~n - 1);< 840565#factENTRY ~n := #in~n; 840618#L25 assume !(~n <= 0); 840521#L26 call #t~ret0 := fact(~n - 1);< 840565#factENTRY ~n := #in~n; 840616#L25 assume ~n <= 0;#res := 1; 840615#factFINAL assume true; 840613#factEXIT >#66#return; 840611#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840566#factFINAL assume true; 840567#factEXIT >#66#return; 840558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840559#factFINAL assume true; 840531#factEXIT >#66#return; 840532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840519#factFINAL assume true; 840522#factEXIT >#66#return; 840533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840722#factFINAL assume true; 840676#factEXIT >#74#return; 840662#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 840665#factENTRY ~n := #in~n; 840675#L25 assume ~n <= 0;#res := 1; 840667#factFINAL assume true; 840661#factEXIT >#76#return; 840664#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 840844#factENTRY ~n := #in~n; 840723#L25 assume !(~n <= 0); 840549#L26 call #t~ret0 := fact(~n - 1);< 840648#factENTRY ~n := #in~n; 840691#L25 assume !(~n <= 0); 840545#L26 call #t~ret0 := fact(~n - 1);< 840596#factENTRY ~n := #in~n; 840688#L25 assume !(~n <= 0); 840544#L26 call #t~ret0 := fact(~n - 1);< 840674#factENTRY ~n := #in~n; 840688#L25 assume !(~n <= 0); 840544#L26 call #t~ret0 := fact(~n - 1);< 840674#factENTRY ~n := #in~n; 840688#L25 assume !(~n <= 0); 840544#L26 call #t~ret0 := fact(~n - 1);< 840674#factENTRY ~n := #in~n; 840688#L25 assume !(~n <= 0); 840544#L26 call #t~ret0 := fact(~n - 1);< 840674#factENTRY ~n := #in~n; 840688#L25 assume !(~n <= 0); 840544#L26 call #t~ret0 := fact(~n - 1);< 840674#factENTRY ~n := #in~n; 840687#L25 assume ~n <= 0;#res := 1; 840685#factFINAL assume true; 840673#factEXIT >#66#return; 840666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840660#factFINAL assume true; 840655#factEXIT >#66#return; 840653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840649#factFINAL assume true; 840646#factEXIT >#66#return; 840642#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840640#factFINAL assume true; 840635#factEXIT >#66#return; 840633#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840632#factFINAL assume true; 840629#factEXIT >#66#return; 840627#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840623#factFINAL assume true; 840620#factEXIT >#66#return; 840569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840570#factFINAL assume true; 840560#factEXIT >#66#return; 840564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840862#factFINAL assume true; 840838#factEXIT >#78#return; 840488#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; 840487#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 840486#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 840485#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 840484#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 840483#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 840482#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840470#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; 840460#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840461#factENTRY ~n := #in~n; 840479#L25 assume !(~n <= 0); 840476#L26 call #t~ret0 := fact(~n - 1);< 840477#factENTRY ~n := #in~n; 840480#L25 assume ~n <= 0;#res := 1; 840478#factFINAL assume true; 840475#factEXIT >#66#return; 840472#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840469#factFINAL assume true; 840459#factEXIT >#68#return; 840369#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 840455#factENTRY ~n := #in~n; 840468#L25 assume ~n <= 0;#res := 1; 840458#factFINAL assume true; 840334#factEXIT >#70#return; 840330#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 840331#factENTRY ~n := #in~n; 840467#L25 assume !(~n <= 0); 840463#L26 call #t~ret0 := fact(~n - 1);< 840466#factENTRY ~n := #in~n; 840473#L25 assume ~n <= 0;#res := 1; 840471#factFINAL assume true; 840462#factEXIT >#66#return; 840457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 840333#factFINAL assume true; 840329#factEXIT >#72#return; 840327#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; 840326#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 840325#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 840323#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840321#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; 840238#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840239#factENTRY ~n := #in~n; 840474#L25 assume !(~n <= 0); 840464#L26 call #t~ret0 := fact(~n - 1);< 840466#factENTRY ~n := #in~n; 840473#L25 assume ~n <= 0;#res := 1; 840471#factFINAL assume true; 840462#factEXIT >#66#return; 840465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842864#factFINAL assume true; 842863#factEXIT >#68#return; 842497#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842500#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 842480#L26 call #t~ret0 := fact(~n - 1);< 842498#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842762#factFINAL assume true; 842738#factEXIT >#70#return; 842057#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842662#factENTRY ~n := #in~n; 842100#L25 assume ~n <= 0;#res := 1; 842101#factFINAL assume true; 842056#factEXIT >#72#return; 842058#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; 842867#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842866#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842865#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842861#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; 842660#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842737#factENTRY ~n := #in~n; 843006#L25 assume !(~n <= 0); 842432#L26 call #t~ret0 := fact(~n - 1);< 842661#factENTRY ~n := #in~n; 842742#L25 assume !(~n <= 0); 842443#L26 call #t~ret0 := fact(~n - 1);< 842733#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842735#factFINAL assume true; 842663#factEXIT >#74#return; 842495#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842854#factENTRY ~n := #in~n; 843503#L25 assume !(~n <= 0); 842486#L26 call #t~ret0 := fact(~n - 1);< 842494#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842853#factFINAL assume true; 842763#factEXIT >#76#return; 842496#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842855#factENTRY ~n := #in~n; 843520#L25 assume !(~n <= 0); 842486#L26 call #t~ret0 := fact(~n - 1);< 842494#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842853#factFINAL assume true; 842763#factEXIT >#78#return; 842807#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; 846571#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 846570#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 846569#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840285#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; 840286#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 845982#factENTRY ~n := #in~n; 846008#L25 assume !(~n <= 0); 846000#L26 call #t~ret0 := fact(~n - 1);< 846007#factENTRY ~n := #in~n; 846321#L25 assume !(~n <= 0); 845996#L26 call #t~ret0 := fact(~n - 1);< 846317#factENTRY ~n := #in~n; 846321#L25 assume !(~n <= 0); 845996#L26 call #t~ret0 := fact(~n - 1);< 846317#factENTRY ~n := #in~n; 846421#L25 assume ~n <= 0;#res := 1; 846420#factFINAL assume true; 846313#factEXIT >#66#return; 846312#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846047#factFINAL assume true; 846023#factEXIT >#66#return; 846021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846009#factFINAL assume true; 845989#factEXIT >#66#return; 845987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845986#factFINAL assume true; 845979#factEXIT >#74#return; 845512#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 846109#factENTRY ~n := #in~n; 846568#L25 assume !(~n <= 0); 844835#L26 call #t~ret0 := fact(~n - 1);< 845478#factENTRY ~n := #in~n; 845523#L25 assume ~n <= 0;#res := 1; 845511#factFINAL assume true; 845472#factEXIT >#66#return; 845476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846134#factFINAL assume true; 846123#factEXIT >#76#return; 844856#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 846912#factENTRY ~n := #in~n; 846913#L25 assume !(~n <= 0); 844839#L26 call #t~ret0 := fact(~n - 1);< 844854#factENTRY ~n := #in~n; 844958#L25 assume !(~n <= 0); 844864#L26 call #t~ret0 := fact(~n - 1);< 844866#factENTRY ~n := #in~n; 845009#L25 assume ~n <= 0;#res := 1; 844956#factFINAL assume true; 844863#factEXIT >#66#return; 844862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844855#factFINAL assume true; 844832#factEXIT >#66#return; 844851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846977#factFINAL assume true; 846968#factEXIT >#78#return; 844606#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; 844601#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 844599#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 844597#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 843947#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; 843831#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 843833#factENTRY ~n := #in~n; 843900#L25 assume !(~n <= 0); 843897#L26 call #t~ret0 := fact(~n - 1);< 843941#factENTRY ~n := #in~n; 843909#L25 assume !(~n <= 0); 843898#L26 call #t~ret0 := fact(~n - 1);< 843938#factENTRY ~n := #in~n; 843909#L25 assume !(~n <= 0); 843898#L26 call #t~ret0 := fact(~n - 1);< 843938#factENTRY ~n := #in~n; 843909#L25 assume !(~n <= 0); 843898#L26 call #t~ret0 := fact(~n - 1);< 843938#factENTRY ~n := #in~n; 843909#L25 assume !(~n <= 0); 843898#L26 call #t~ret0 := fact(~n - 1);< 843938#factENTRY ~n := #in~n; 843909#L25 assume !(~n <= 0); 843898#L26 call #t~ret0 := fact(~n - 1);< 843938#factENTRY ~n := #in~n; 843909#L25 assume !(~n <= 0); 843898#L26 call #t~ret0 := fact(~n - 1);< 843938#factENTRY ~n := #in~n; 843909#L25 assume !(~n <= 0); 843898#L26 call #t~ret0 := fact(~n - 1);< 843938#factENTRY ~n := #in~n; 843940#L25 assume ~n <= 0;#res := 1; 843939#factFINAL assume true; 843937#factEXIT >#66#return; 843936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843932#factFINAL assume true; 843933#factEXIT >#66#return; 843945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843927#factFINAL assume true; 843928#factEXIT >#66#return; 843924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843922#factFINAL assume true; 843923#factEXIT >#66#return; 843944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843943#factFINAL assume true; 843942#factEXIT >#66#return; 843916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843914#factFINAL assume true; 843915#factEXIT >#66#return; 843952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843907#factFINAL assume true; 843908#factEXIT >#66#return; 843951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843896#factFINAL assume true; 843899#factEXIT >#66#return; 843889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843890#factFINAL assume true; 843824#factEXIT >#74#return; 843820#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 843822#factENTRY ~n := #in~n; 843848#L25 assume !(~n <= 0); 843836#L26 call #t~ret0 := fact(~n - 1);< 843844#factENTRY ~n := #in~n; 843849#L25 assume ~n <= 0;#res := 1; 843845#factFINAL assume true; 843835#factEXIT >#66#return; 843834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843823#factFINAL assume true; 843819#factEXIT >#76#return; 843768#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 843818#factENTRY ~n := #in~n; 844438#L25 assume !(~n <= 0); 844022#L26 call #t~ret0 := fact(~n - 1);< 844029#factENTRY ~n := #in~n; 844133#L25 assume !(~n <= 0); 844021#L26 call #t~ret0 := fact(~n - 1);< 844065#factENTRY ~n := #in~n; 844328#L25 assume !(~n <= 0); 844025#L26 call #t~ret0 := fact(~n - 1);< 844096#factENTRY ~n := #in~n; 844239#L25 assume !(~n <= 0); 844059#L26 call #t~ret0 := fact(~n - 1);< 844140#factENTRY ~n := #in~n; 844148#L25 assume !(~n <= 0); 843986#L26 call #t~ret0 := fact(~n - 1);< 844097#factENTRY ~n := #in~n; 844246#L25 assume !(~n <= 0); 843993#L26 call #t~ret0 := fact(~n - 1);< 844142#factENTRY ~n := #in~n; 844218#L25 assume ~n <= 0;#res := 1; 844216#factFINAL assume true; 844045#factEXIT >#66#return; 844042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844030#factFINAL assume true; 843973#factEXIT >#66#return; 844000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844211#factFINAL assume true; 844115#factEXIT >#66#return; 844123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844128#factFINAL assume true; 844086#factEXIT >#66#return; 844082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844070#factFINAL assume true; 844054#factEXIT >#66#return; 844044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844034#factFINAL assume true; 844006#factEXIT >#66#return; 843972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843968#factFINAL assume true; 843964#factEXIT >#78#return; 843766#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; 843765#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 843764#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843763#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 843761#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 843759#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 843757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842980#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; 842977#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842978#factENTRY ~n := #in~n; 842991#L25 assume !(~n <= 0); 842988#L26 call #t~ret0 := fact(~n - 1);< 842990#factENTRY ~n := #in~n; 840481#L25 assume !(~n <= 0); 842985#L26 call #t~ret0 := fact(~n - 1);< 842998#factENTRY ~n := #in~n; 843000#L25 assume ~n <= 0;#res := 1; 842999#factFINAL assume true; 842997#factEXIT >#66#return; 842996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842992#factFINAL assume true; 842984#factEXIT >#66#return; 842983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842982#factFINAL assume true; 842976#factEXIT >#68#return; 840372#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 840455#factENTRY ~n := #in~n; 840468#L25 assume ~n <= 0;#res := 1; 840458#factFINAL assume true; 840334#factEXIT >#70#return; 840431#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842936#factENTRY ~n := #in~n; 842995#L25 assume !(~n <= 0); 842640#L26 call #t~ret0 := fact(~n - 1);< 842659#factENTRY ~n := #in~n; 842937#L25 assume !(~n <= 0); 842639#L26 call #t~ret0 := fact(~n - 1);< 842732#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842645#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842953#factFINAL assume true; 842935#factEXIT >#72#return; 842934#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; 842933#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842932#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842930#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842928#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; 842664#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842736#factENTRY ~n := #in~n; 842927#L25 assume !(~n <= 0); 842642#L26 call #t~ret0 := fact(~n - 1);< 842650#factENTRY ~n := #in~n; 842939#L25 assume !(~n <= 0); 842729#L26 call #t~ret0 := fact(~n - 1);< 842730#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842735#factFINAL assume true; 842663#factEXIT >#68#return; 842665#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842725#factENTRY ~n := #in~n; 842885#L25 assume !(~n <= 0); 842483#L26 call #t~ret0 := fact(~n - 1);< 842498#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842853#factFINAL assume true; 842763#factEXIT >#70#return; 842748#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842761#factENTRY ~n := #in~n; 842873#L25 assume !(~n <= 0); 842478#L26 call #t~ret0 := fact(~n - 1);< 842494#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842862#factFINAL assume true; 842747#factEXIT >#72#return; 842746#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; 842745#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842744#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842743#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842741#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; 842666#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842736#factENTRY ~n := #in~n; 842927#L25 assume !(~n <= 0); 842642#L26 call #t~ret0 := fact(~n - 1);< 842650#factENTRY ~n := #in~n; 842939#L25 assume !(~n <= 0); 842729#L26 call #t~ret0 := fact(~n - 1);< 842730#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842735#factFINAL assume true; 842663#factEXIT >#68#return; 842667#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842725#factENTRY ~n := #in~n; 842885#L25 assume !(~n <= 0); 842483#L26 call #t~ret0 := fact(~n - 1);< 842498#factENTRY ~n := #in~n; 842939#L25 assume !(~n <= 0); 842729#L26 call #t~ret0 := fact(~n - 1);< 842730#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842735#factFINAL assume true; 842663#factEXIT >#70#return; 842095#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842060#factENTRY ~n := #in~n; 842102#L25 assume ~n <= 0;#res := 1; 842061#factFINAL assume true; 842099#factEXIT >#72#return; 842637#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; 842635#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842630#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842589#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842587#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; 842339#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842584#factENTRY ~n := #in~n; 843015#L25 assume !(~n <= 0); 842431#L26 call #t~ret0 := fact(~n - 1);< 842661#factENTRY ~n := #in~n; 842742#L25 assume !(~n <= 0); 842443#L26 call #t~ret0 := fact(~n - 1);< 842733#factENTRY ~n := #in~n; 842742#L25 assume !(~n <= 0); 842443#L26 call #t~ret0 := fact(~n - 1);< 842733#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842585#factFINAL assume true; 842504#factEXIT >#74#return; 842501#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842502#factENTRY ~n := #in~n; 842875#L25 assume !(~n <= 0); 842489#L26 call #t~ret0 := fact(~n - 1);< 842498#factENTRY ~n := #in~n; 842939#L25 assume !(~n <= 0); 842729#L26 call #t~ret0 := fact(~n - 1);< 842730#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842735#factFINAL assume true; 842663#factEXIT >#76#return; 842724#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842955#factENTRY ~n := #in~n; 842954#L25 assume !(~n <= 0); 842477#L26 call #t~ret0 := fact(~n - 1);< 842498#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842853#factFINAL assume true; 842763#factEXIT >#78#return; 842840#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; 844500#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 844501#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 847452#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 846529#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; 845981#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 845982#factENTRY ~n := #in~n; 846008#L25 assume !(~n <= 0); 846000#L26 call #t~ret0 := fact(~n - 1);< 846007#factENTRY ~n := #in~n; 846321#L25 assume !(~n <= 0); 845996#L26 call #t~ret0 := fact(~n - 1);< 846317#factENTRY ~n := #in~n; 846321#L25 assume !(~n <= 0); 845996#L26 call #t~ret0 := fact(~n - 1);< 846317#factENTRY ~n := #in~n; 846421#L25 assume ~n <= 0;#res := 1; 846420#factFINAL assume true; 846313#factEXIT >#66#return; 846312#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846047#factFINAL assume true; 846023#factEXIT >#66#return; 846021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846009#factFINAL assume true; 845989#factEXIT >#66#return; 845987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845986#factFINAL assume true; 845979#factEXIT >#74#return; 845513#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 846111#factENTRY ~n := #in~n; 847448#L25 assume !(~n <= 0); 847066#L26 call #t~ret0 := fact(~n - 1);< 847099#factENTRY ~n := #in~n; 847113#L25 assume !(~n <= 0); 847109#L26 call #t~ret0 := fact(~n - 1);< 847111#factENTRY ~n := #in~n; 847150#L25 assume ~n <= 0;#res := 1; 847149#factFINAL assume true; 847108#factEXIT >#66#return; 847107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847103#factFINAL assume true; 847059#factEXIT >#66#return; 847092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847551#factFINAL assume true; 847550#factEXIT >#76#return; 847105#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 847413#factENTRY ~n := #in~n; 847414#L25 assume !(~n <= 0); 847064#L26 call #t~ret0 := fact(~n - 1);< 847106#factENTRY ~n := #in~n; 847113#L25 assume !(~n <= 0); 847109#L26 call #t~ret0 := fact(~n - 1);< 847111#factENTRY ~n := #in~n; 847150#L25 assume ~n <= 0;#res := 1; 847149#factFINAL assume true; 847108#factEXIT >#66#return; 847107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847103#factFINAL assume true; 847059#factEXIT >#66#return; 847091#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847593#factFINAL assume true; 847590#factEXIT >#78#return; 840261#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; 840262#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 847648#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 840296#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 840297#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; 844209#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 844210#factENTRY ~n := #in~n; 844267#L25 assume !(~n <= 0); 843992#L26 call #t~ret0 := fact(~n - 1);< 844265#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844218#L25 assume ~n <= 0;#res := 1; 844216#factFINAL assume true; 844045#factEXIT >#66#return; 844042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844030#factFINAL assume true; 843973#factEXIT >#66#return; 844000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844211#factFINAL assume true; 844115#factEXIT >#66#return; 844123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844128#factFINAL assume true; 844086#factEXIT >#66#return; 844082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844070#factFINAL assume true; 844054#factEXIT >#66#return; 844044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844034#factFINAL assume true; 844006#factEXIT >#66#return; 844027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844440#factFINAL assume true; 844423#factEXIT >#66#return; 844420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844414#factFINAL assume true; 844401#factEXIT >#66#return; 844399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844285#factFINAL assume true; 844270#factEXIT >#66#return; 844275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844379#factFINAL assume true; 844372#factEXIT >#66#return; 844373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844397#factFINAL assume true; 844247#factEXIT >#74#return; 844190#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 844201#factENTRY ~n := #in~n; 844251#L25 assume !(~n <= 0); 843837#L26 call #t~ret0 := fact(~n - 1);< 843844#factENTRY ~n := #in~n; 843850#L25 assume !(~n <= 0); 844046#L26 call #t~ret0 := fact(~n - 1);< 844049#factENTRY ~n := #in~n; 844218#L25 assume ~n <= 0;#res := 1; 844216#factFINAL assume true; 844045#factEXIT >#66#return; 844042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844030#factFINAL assume true; 843973#factEXIT >#66#return; 843997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844240#factFINAL assume true; 844186#factEXIT >#76#return; 844183#L30-7 [2022-11-18 20:35:59,987 INFO L750 eck$LassoCheckResult]: Loop: 844183#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 844256#factENTRY ~n := #in~n; 844469#L25 assume !(~n <= 0); 844038#L26 call #t~ret0 := fact(~n - 1);< 844276#factENTRY ~n := #in~n; 844439#L25 assume !(~n <= 0); 844015#L26 call #t~ret0 := fact(~n - 1);< 844029#factENTRY ~n := #in~n; 844133#L25 assume !(~n <= 0); 844021#L26 call #t~ret0 := fact(~n - 1);< 844065#factENTRY ~n := #in~n; 844328#L25 assume !(~n <= 0); 844025#L26 call #t~ret0 := fact(~n - 1);< 844096#factENTRY ~n := #in~n; 844239#L25 assume !(~n <= 0); 844059#L26 call #t~ret0 := fact(~n - 1);< 844140#factENTRY ~n := #in~n; 844148#L25 assume !(~n <= 0); 843986#L26 call #t~ret0 := fact(~n - 1);< 844097#factENTRY ~n := #in~n; 844246#L25 assume !(~n <= 0); 843993#L26 call #t~ret0 := fact(~n - 1);< 844142#factENTRY ~n := #in~n; 844468#L25 assume !(~n <= 0); 843991#L26 call #t~ret0 := fact(~n - 1);< 844047#factENTRY ~n := #in~n; 843850#L25 assume !(~n <= 0); 844046#L26 call #t~ret0 := fact(~n - 1);< 844049#factENTRY ~n := #in~n; 844218#L25 assume ~n <= 0;#res := 1; 844216#factFINAL assume true; 844045#factEXIT >#66#return; 844042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844030#factFINAL assume true; 843973#factEXIT >#66#return; 844000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844211#factFINAL assume true; 844115#factEXIT >#66#return; 844123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844128#factFINAL assume true; 844086#factEXIT >#66#return; 844082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844070#factFINAL assume true; 844054#factEXIT >#66#return; 844044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844034#factFINAL assume true; 844006#factEXIT >#66#return; 844027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844440#factFINAL assume true; 844423#factEXIT >#66#return; 844420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844414#factFINAL assume true; 844401#factEXIT >#66#return; 844399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844285#factFINAL assume true; 844270#factEXIT >#66#return; 844269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844254#factFINAL assume true; 844202#factEXIT >#78#return; 843805#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; 843802#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 843799#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843794#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 843793#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 843792#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 843771#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 843772#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; 843385#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 840237#factENTRY ~n := #in~n; 843444#L25 assume !(~n <= 0); 842986#L26 call #t~ret0 := fact(~n - 1);< 842990#factENTRY ~n := #in~n; 840481#L25 assume !(~n <= 0); 842985#L26 call #t~ret0 := fact(~n - 1);< 842998#factENTRY ~n := #in~n; 840481#L25 assume !(~n <= 0); 842985#L26 call #t~ret0 := fact(~n - 1);< 842998#factENTRY ~n := #in~n; 843000#L25 assume ~n <= 0;#res := 1; 842999#factFINAL assume true; 842997#factEXIT >#66#return; 842996#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842992#factFINAL assume true; 842984#factEXIT >#66#return; 842989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843499#factFINAL assume true; 843497#factEXIT >#66#return; 843498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843562#factFINAL assume true; 843550#factEXIT >#68#return; 840352#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 840455#factENTRY ~n := #in~n; 840468#L25 assume ~n <= 0;#res := 1; 840458#factFINAL assume true; 840334#factEXIT >#70#return; 840413#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 843517#factENTRY ~n := #in~n; 843694#L25 assume !(~n <= 0); 842605#L26 call #t~ret0 := fact(~n - 1);< 842880#factENTRY ~n := #in~n; 842878#L25 assume !(~n <= 0); 842643#L26 call #t~ret0 := fact(~n - 1);< 842650#factENTRY ~n := #in~n; 842939#L25 assume !(~n <= 0); 842729#L26 call #t~ret0 := fact(~n - 1);< 842730#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842627#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843516#factFINAL assume true; 843378#factEXIT >#72#return; 843379#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; 846771#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 846770#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 846769#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 846768#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; 842331#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842981#factENTRY ~n := #in~n; 842979#L25 assume !(~n <= 0); 842618#L26 call #t~ret0 := fact(~n - 1);< 842628#factENTRY ~n := #in~n; 842961#L25 assume !(~n <= 0); 842615#L26 call #t~ret0 := fact(~n - 1);< 842949#factENTRY ~n := #in~n; 842947#L25 assume !(~n <= 0); 842599#L26 call #t~ret0 := fact(~n - 1);< 842893#factENTRY ~n := #in~n; 842890#L25 assume !(~n <= 0); 842607#L26 call #t~ret0 := fact(~n - 1);< 842883#factENTRY ~n := #in~n; 842882#L25 assume !(~n <= 0); 842604#L26 call #t~ret0 := fact(~n - 1);< 842857#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843317#factFINAL assume true; 843308#factEXIT >#66#return; 843307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843298#factFINAL assume true; 843288#factEXIT >#66#return; 843293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843278#factFINAL assume true; 843161#factEXIT >#68#return; 842508#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842881#factENTRY ~n := #in~n; 842879#L25 assume !(~n <= 0); 842479#L26 call #t~ret0 := fact(~n - 1);< 842859#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842853#factFINAL assume true; 842763#factEXIT >#70#return; 842797#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 843163#factENTRY ~n := #in~n; 842942#L25 assume !(~n <= 0); 842610#L26 call #t~ret0 := fact(~n - 1);< 842887#factENTRY ~n := #in~n; 842886#L25 assume !(~n <= 0); 842608#L26 call #t~ret0 := fact(~n - 1);< 842884#factENTRY ~n := #in~n; 842882#L25 assume !(~n <= 0); 842604#L26 call #t~ret0 := fact(~n - 1);< 842857#factENTRY ~n := #in~n; 842856#L25 assume !(~n <= 0); 842644#L26 call #t~ret0 := fact(~n - 1);< 842732#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843317#factFINAL assume true; 843308#factEXIT >#66#return; 843310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843215#factFINAL assume true; 843137#factEXIT >#72#return; 843072#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; 846765#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 846764#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 846763#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 846762#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; 842197#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842981#factENTRY ~n := #in~n; 842979#L25 assume !(~n <= 0); 842618#L26 call #t~ret0 := fact(~n - 1);< 842628#factENTRY ~n := #in~n; 842961#L25 assume !(~n <= 0); 842615#L26 call #t~ret0 := fact(~n - 1);< 842949#factENTRY ~n := #in~n; 842947#L25 assume !(~n <= 0); 842599#L26 call #t~ret0 := fact(~n - 1);< 842893#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842585#factFINAL assume true; 842504#factEXIT >#68#return; 842522#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842881#factENTRY ~n := #in~n; 842879#L25 assume !(~n <= 0); 842479#L26 call #t~ret0 := fact(~n - 1);< 842859#factENTRY ~n := #in~n; 842856#L25 assume !(~n <= 0); 842644#L26 call #t~ret0 := fact(~n - 1);< 842732#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842735#factFINAL assume true; 842663#factEXIT >#70#return; 842072#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842734#factENTRY ~n := #in~n; 842727#L25 assume !(~n <= 0); 842482#L26 call #t~ret0 := fact(~n - 1);< 842498#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842862#factFINAL assume true; 842747#factEXIT >#72#return; 842759#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; 843176#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 843172#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843170#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 843165#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; 842289#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842981#factENTRY ~n := #in~n; 842979#L25 assume !(~n <= 0); 842618#L26 call #t~ret0 := fact(~n - 1);< 842628#factENTRY ~n := #in~n; 842961#L25 assume !(~n <= 0); 842615#L26 call #t~ret0 := fact(~n - 1);< 842949#factENTRY ~n := #in~n; 842947#L25 assume !(~n <= 0); 842599#L26 call #t~ret0 := fact(~n - 1);< 842893#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842585#factFINAL assume true; 842504#factEXIT >#68#return; 842379#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842881#factENTRY ~n := #in~n; 842879#L25 assume !(~n <= 0); 842479#L26 call #t~ret0 := fact(~n - 1);< 842859#factENTRY ~n := #in~n; 842856#L25 assume !(~n <= 0); 842644#L26 call #t~ret0 := fact(~n - 1);< 842732#factENTRY ~n := #in~n; 842939#L25 assume !(~n <= 0); 842729#L26 call #t~ret0 := fact(~n - 1);< 842730#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842585#factFINAL assume true; 842504#factEXIT >#70#return; 842076#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842060#factENTRY ~n := #in~n; 842102#L25 assume ~n <= 0;#res := 1; 842061#factFINAL assume true; 842099#factEXIT >#72#return; 842655#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; 843602#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 843186#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843185#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 843183#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; 842113#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 843018#factENTRY ~n := #in~n; 843014#L25 assume !(~n <= 0); 842427#L26 call #t~ret0 := fact(~n - 1);< 842661#factENTRY ~n := #in~n; 842742#L25 assume !(~n <= 0); 842443#L26 call #t~ret0 := fact(~n - 1);< 842733#factENTRY ~n := #in~n; 842742#L25 assume !(~n <= 0); 842443#L26 call #t~ret0 := fact(~n - 1);< 842733#factENTRY ~n := #in~n; 842742#L25 assume !(~n <= 0); 842443#L26 call #t~ret0 := fact(~n - 1);< 842733#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843317#factFINAL assume true; 843308#factEXIT >#66#return; 843311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843506#factFINAL assume true; 842104#factEXIT >#74#return; 842356#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842586#factENTRY ~n := #in~n; 842888#L25 assume !(~n <= 0); 842591#L26 call #t~ret0 := fact(~n - 1);< 842880#factENTRY ~n := #in~n; 842878#L25 assume !(~n <= 0); 842643#L26 call #t~ret0 := fact(~n - 1);< 842650#factENTRY ~n := #in~n; 842939#L25 assume !(~n <= 0); 842729#L26 call #t~ret0 := fact(~n - 1);< 842730#factENTRY ~n := #in~n; 842740#L25 assume ~n <= 0;#res := 1; 842739#factFINAL assume true; 842728#factEXIT >#66#return; 842726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842658#factFINAL assume true; 842638#factEXIT >#66#return; 842636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842631#factFINAL assume true; 842590#factEXIT >#66#return; 842588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842585#factFINAL assume true; 842504#factEXIT >#76#return; 842538#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842955#factENTRY ~n := #in~n; 842954#L25 assume !(~n <= 0); 842477#L26 call #t~ret0 := fact(~n - 1);< 842498#factENTRY ~n := #in~n; 842476#L25 assume ~n <= 0;#res := 1; 842493#factFINAL assume true; 842871#factEXIT >#66#return; 842860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842853#factFINAL assume true; 842763#factEXIT >#78#return; 842796#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; 846653#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 846652#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 846651#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 846650#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; 844753#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 844781#factENTRY ~n := #in~n; 846690#L25 assume !(~n <= 0); 844931#L26 call #t~ret0 := fact(~n - 1);< 846648#factENTRY ~n := #in~n; 846808#L25 assume !(~n <= 0); 844934#L26 call #t~ret0 := fact(~n - 1);< 846713#factENTRY ~n := #in~n; 846808#L25 assume !(~n <= 0); 844934#L26 call #t~ret0 := fact(~n - 1);< 846713#factENTRY ~n := #in~n; 846808#L25 assume !(~n <= 0); 844934#L26 call #t~ret0 := fact(~n - 1);< 846713#factENTRY ~n := #in~n; 846782#L25 assume ~n <= 0;#res := 1; 846837#factFINAL assume true; 846708#factEXIT >#66#return; 846707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846664#factFINAL assume true; 846614#factEXIT >#66#return; 846627#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846534#factFINAL assume true; 846202#factEXIT >#66#return; 846195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846201#factFINAL assume true; 846216#factEXIT >#66#return; 844900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844868#factFINAL assume true; 844869#factEXIT >#74#return; 844723#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 844730#factENTRY ~n := #in~n; 847404#L25 assume !(~n <= 0); 847173#L26 call #t~ret0 := fact(~n - 1);< 847182#factENTRY ~n := #in~n; 847219#L25 assume !(~n <= 0); 847075#L26 call #t~ret0 := fact(~n - 1);< 847106#factENTRY ~n := #in~n; 847113#L25 assume !(~n <= 0); 847109#L26 call #t~ret0 := fact(~n - 1);< 847111#factENTRY ~n := #in~n; 847150#L25 assume ~n <= 0;#res := 1; 847149#factFINAL assume true; 847108#factEXIT >#66#return; 847107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847103#factFINAL assume true; 847059#factEXIT >#66#return; 847090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847199#factFINAL assume true; 847168#factEXIT >#66#return; 847180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847441#factFINAL assume true; 847440#factEXIT >#76#return; 847025#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 847028#factENTRY ~n := #in~n; 847403#L25 assume !(~n <= 0); 847077#L26 call #t~ret0 := fact(~n - 1);< 847106#factENTRY ~n := #in~n; 847113#L25 assume !(~n <= 0); 847109#L26 call #t~ret0 := fact(~n - 1);< 847111#factENTRY ~n := #in~n; 847150#L25 assume ~n <= 0;#res := 1; 847149#factFINAL assume true; 847108#factEXIT >#66#return; 847107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847103#factFINAL assume true; 847059#factEXIT >#66#return; 847097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 847534#factFINAL assume true; 847020#factEXIT >#78#return; 847019#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; 847014#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 847013#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 847004#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 844259#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; 844208#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 844210#factENTRY ~n := #in~n; 844267#L25 assume !(~n <= 0); 843992#L26 call #t~ret0 := fact(~n - 1);< 844265#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844052#L25 assume !(~n <= 0); 843982#L26 call #t~ret0 := fact(~n - 1);< 844050#factENTRY ~n := #in~n; 844218#L25 assume ~n <= 0;#res := 1; 844216#factFINAL assume true; 844045#factEXIT >#66#return; 844042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844030#factFINAL assume true; 843973#factEXIT >#66#return; 844000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844211#factFINAL assume true; 844115#factEXIT >#66#return; 844123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844128#factFINAL assume true; 844086#factEXIT >#66#return; 844082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844070#factFINAL assume true; 844054#factEXIT >#66#return; 844044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844034#factFINAL assume true; 844006#factEXIT >#66#return; 844027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844440#factFINAL assume true; 844423#factEXIT >#66#return; 844420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844414#factFINAL assume true; 844401#factEXIT >#66#return; 844399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844285#factFINAL assume true; 844270#factEXIT >#66#return; 844275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844379#factFINAL assume true; 844372#factEXIT >#66#return; 844373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844397#factFINAL assume true; 844247#factEXIT >#74#return; 844164#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 844185#factENTRY ~n := #in~n; 844288#L25 assume !(~n <= 0); 844117#L26 call #t~ret0 := fact(~n - 1);< 844127#factENTRY ~n := #in~n; 844215#L25 assume !(~n <= 0); 843980#L26 call #t~ret0 := fact(~n - 1);< 844031#factENTRY ~n := #in~n; 843850#L25 assume !(~n <= 0); 844046#L26 call #t~ret0 := fact(~n - 1);< 844049#factENTRY ~n := #in~n; 844218#L25 assume ~n <= 0;#res := 1; 844216#factFINAL assume true; 844045#factEXIT >#66#return; 844042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844030#factFINAL assume true; 843973#factEXIT >#66#return; 844000#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844211#factFINAL assume true; 844115#factEXIT >#66#return; 844121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844243#factFINAL assume true; 844152#factEXIT >#76#return; 844183#L30-7 [2022-11-18 20:35:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1616320748, now seen corresponding path program 57 times [2022-11-18 20:35:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:59,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123495511] [2022-11-18 20:35:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:00,040 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:00,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615767581] [2022-11-18 20:36:00,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:36:00,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:00,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:00,043 INFO L229 MonitoredProcess]: Starting monitored process 325 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:00,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (325)] Waiting until timeout for monitored process [2022-11-18 20:36:02,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-18 20:36:02,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:02,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:36:02,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 45207 backedges. 3951 proven. 476 refuted. 0 times theorem prover too weak. 40780 trivial. 0 not checked. [2022-11-18 20:36:02,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 45207 backedges. 3951 proven. 489 refuted. 0 times theorem prover too weak. 40767 trivial. 0 not checked. [2022-11-18 20:36:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:04,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123495511] [2022-11-18 20:36:04,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:04,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615767581] [2022-11-18 20:36:04,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615767581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:04,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:04,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2022-11-18 20:36:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552236493] [2022-11-18 20:36:04,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:04,437 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:36:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1887621175, now seen corresponding path program 41 times [2022-11-18 20:36:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:04,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981265645] [2022-11-18 20:36:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:04,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:04,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006958900] [2022-11-18 20:36:04,478 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:36:04,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:04,487 INFO L229 MonitoredProcess]: Starting monitored process 326 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:04,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (326)] Waiting until timeout for monitored process [2022-11-18 20:36:06,773 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-18 20:36:06,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:06,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:36:06,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19849 backedges. 8800 proven. 205 refuted. 0 times theorem prover too weak. 10844 trivial. 0 not checked. [2022-11-18 20:36:07,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19849 backedges. 620 proven. 2683 refuted. 0 times theorem prover too weak. 16546 trivial. 0 not checked. [2022-11-18 20:36:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:08,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981265645] [2022-11-18 20:36:08,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:08,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006958900] [2022-11-18 20:36:08,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006958900] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:08,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:08,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 28 [2022-11-18 20:36:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561395341] [2022-11-18 20:36:08,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:08,994 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:36:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:36:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:36:08,995 INFO L87 Difference]: Start difference. First operand 7447 states and 16107 transitions. cyclomatic complexity: 8724 Second operand has 28 states, 24 states have (on average 3.25) internal successors, (78), 28 states have internal predecessors, (78), 18 states have call successors, (33), 2 states have call predecessors, (33), 11 states have return successors, (38), 12 states have call predecessors, (38), 18 states have call successors, (38) [2022-11-18 20:36:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:10,688 INFO L93 Difference]: Finished difference Result 8273 states and 17952 transitions. [2022-11-18 20:36:10,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8273 states and 17952 transitions. [2022-11-18 20:36:10,774 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1662 [2022-11-18 20:36:10,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8273 states to 8272 states and 17951 transitions. [2022-11-18 20:36:10,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2815 [2022-11-18 20:36:10,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2815 [2022-11-18 20:36:10,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8272 states and 17951 transitions. [2022-11-18 20:36:10,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:36:10,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8272 states and 17951 transitions. [2022-11-18 20:36:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8272 states and 17951 transitions. [2022-11-18 20:36:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8272 to 7601. [2022-11-18 20:36:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7601 states, 4328 states have (on average 1.0397412199630314) internal successors, (4500), 4308 states have internal predecessors, (4500), 2494 states have call successors, (2595), 1004 states have call predecessors, (2595), 779 states have return successors, (9237), 2288 states have call predecessors, (9237), 2494 states have call successors, (9237) [2022-11-18 20:36:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7601 states to 7601 states and 16332 transitions. [2022-11-18 20:36:11,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7601 states and 16332 transitions. [2022-11-18 20:36:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:36:11,121 INFO L428 stractBuchiCegarLoop]: Abstraction has 7601 states and 16332 transitions. [2022-11-18 20:36:11,121 INFO L335 stractBuchiCegarLoop]: ======== Iteration 74 ============ [2022-11-18 20:36:11,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7601 states and 16332 transitions. [2022-11-18 20:36:11,152 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1318 [2022-11-18 20:36:11,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:36:11,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:36:11,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [135, 135, 88, 88, 88, 88, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:36:11,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [85, 85, 64, 64, 64, 64, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:36:11,156 INFO L748 eck$LassoCheckResult]: Stem: 864506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 864473#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; 864474#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 864505#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; 864533#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 864544#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864542#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; 864540#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864541#factENTRY ~n := #in~n; 864549#L25 assume ~n <= 0;#res := 1; 864547#factFINAL assume true; 864539#factEXIT >#68#return; 864528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864529#factENTRY ~n := #in~n; 864545#L25 assume ~n <= 0;#res := 1; 864543#factFINAL assume true; 864538#factEXIT >#70#return; 864449#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864450#factENTRY ~n := #in~n; 864554#L25 assume ~n <= 0;#res := 1; 864553#factFINAL assume true; 864552#factEXIT >#72#return; 864551#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; 864499#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864500#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 865205#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 865204#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; 865202#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 865203#factENTRY ~n := #in~n; 865214#L25 assume !(~n <= 0); 865211#L26 call #t~ret0 := fact(~n - 1);< 865212#factENTRY ~n := #in~n; 865223#L25 assume ~n <= 0;#res := 1; 865222#factFINAL assume true; 865210#factEXIT >#66#return; 865209#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865207#factFINAL assume true; 865201#factEXIT >#74#return; 865198#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 865199#factENTRY ~n := #in~n; 865226#L25 assume ~n <= 0;#res := 1; 865224#factFINAL assume true; 865197#factEXIT >#76#return; 865194#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 865195#factENTRY ~n := #in~n; 865220#L25 assume !(~n <= 0); 865217#L26 call #t~ret0 := fact(~n - 1);< 865218#factENTRY ~n := #in~n; 865221#L25 assume ~n <= 0;#res := 1; 865219#factFINAL assume true; 865216#factEXIT >#66#return; 865215#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865213#factFINAL assume true; 865193#factEXIT >#78#return; 865190#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; 865187#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 865182#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 865176#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 865170#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; 865158#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 865159#factENTRY ~n := #in~n; 865186#L25 assume !(~n <= 0); 865179#L26 call #t~ret0 := fact(~n - 1);< 865181#factENTRY ~n := #in~n; 865230#L25 assume !(~n <= 0); 865180#L26 call #t~ret0 := fact(~n - 1);< 865228#factENTRY ~n := #in~n; 865231#L25 assume ~n <= 0;#res := 1; 865229#factFINAL assume true; 865227#factEXIT >#66#return; 865225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865185#factFINAL assume true; 865178#factEXIT >#66#return; 865175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865169#factFINAL assume true; 865157#factEXIT >#74#return; 865153#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 865154#factENTRY ~n := #in~n; 865167#L25 assume ~n <= 0;#res := 1; 865156#factFINAL assume true; 865152#factEXIT >#76#return; 865149#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 865150#factENTRY ~n := #in~n; 865168#L25 assume !(~n <= 0); 865163#L26 call #t~ret0 := fact(~n - 1);< 865166#factENTRY ~n := #in~n; 865200#L25 assume !(~n <= 0); 865164#L26 call #t~ret0 := fact(~n - 1);< 865184#factENTRY ~n := #in~n; 865192#L25 assume ~n <= 0;#res := 1; 865189#factFINAL assume true; 865183#factEXIT >#66#return; 865177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865171#factFINAL assume true; 865160#factEXIT >#66#return; 865155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865151#factFINAL assume true; 865148#factEXIT >#78#return; 865147#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; 865146#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 865145#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 865144#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 865142#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; 865143#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 865208#factENTRY ~n := #in~n; 865206#L25 assume !(~n <= 0); 865161#L26 call #t~ret0 := fact(~n - 1);< 865166#factENTRY ~n := #in~n; 865200#L25 assume !(~n <= 0); 865164#L26 call #t~ret0 := fact(~n - 1);< 865184#factENTRY ~n := #in~n; 865200#L25 assume !(~n <= 0); 865164#L26 call #t~ret0 := fact(~n - 1);< 865184#factENTRY ~n := #in~n; 865192#L25 assume ~n <= 0;#res := 1; 865189#factFINAL assume true; 865183#factEXIT >#66#return; 865177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865171#factFINAL assume true; 865160#factEXIT >#66#return; 865165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865239#factFINAL assume true; 865235#factEXIT >#66#return; 865234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865233#factFINAL assume true; 865232#factEXIT >#74#return; 865117#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 865133#factENTRY ~n := #in~n; 865340#L25 assume ~n <= 0;#res := 1; 865116#factFINAL assume true; 865118#factEXIT >#76#return; 865269#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 865323#factENTRY ~n := #in~n; 865324#L25 assume !(~n <= 0); 865249#L26 call #t~ret0 := fact(~n - 1);< 865266#factENTRY ~n := #in~n; 865286#L25 assume !(~n <= 0); 865245#L26 call #t~ret0 := fact(~n - 1);< 865254#factENTRY ~n := #in~n; 865285#L25 assume !(~n <= 0); 865243#L26 call #t~ret0 := fact(~n - 1);< 865284#factENTRY ~n := #in~n; 865310#L25 assume ~n <= 0;#res := 1; 865309#factFINAL assume true; 865283#factEXIT >#66#return; 865277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865275#factFINAL assume true; 865273#factEXIT >#66#return; 865270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865268#factFINAL assume true; 865262#factEXIT >#66#return; 865253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865541#factFINAL assume true; 865342#factEXIT >#78#return; 865047#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; 865042#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 865022#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864969#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864871#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; 864862#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864868#factENTRY ~n := #in~n; 864864#L25 assume !(~n <= 0); 864753#L26 call #t~ret0 := fact(~n - 1);< 864863#factENTRY ~n := #in~n; 864844#L25 assume !(~n <= 0); 864752#L26 call #t~ret0 := fact(~n - 1);< 864788#factENTRY ~n := #in~n; 864844#L25 assume !(~n <= 0); 864752#L26 call #t~ret0 := fact(~n - 1);< 864788#factENTRY ~n := #in~n; 864844#L25 assume !(~n <= 0); 864752#L26 call #t~ret0 := fact(~n - 1);< 864788#factENTRY ~n := #in~n; 864841#L25 assume ~n <= 0;#res := 1; 864839#factFINAL assume true; 864837#factEXIT >#66#return; 864835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864789#factFINAL assume true; 864790#factEXIT >#66#return; 864781#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864782#factFINAL assume true; 864751#factEXIT >#66#return; 864754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864861#factFINAL assume true; 864755#factEXIT >#66#return; 864757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865015#factFINAL assume true; 864984#factEXIT >#74#return; 864975#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864976#factENTRY ~n := #in~n; 864983#L25 assume ~n <= 0;#res := 1; 864981#factFINAL assume true; 864973#factEXIT >#76#return; 864721#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864962#factENTRY ~n := #in~n; 864963#L25 assume !(~n <= 0); 864773#L26 call #t~ret0 := fact(~n - 1);< 864893#factENTRY ~n := #in~n; 864918#L25 assume !(~n <= 0); 864774#L26 call #t~ret0 := fact(~n - 1);< 864820#factENTRY ~n := #in~n; 864914#L25 assume !(~n <= 0); 864775#L26 call #t~ret0 := fact(~n - 1);< 864912#factENTRY ~n := #in~n; 864914#L25 assume !(~n <= 0); 864775#L26 call #t~ret0 := fact(~n - 1);< 864912#factENTRY ~n := #in~n; 864914#L25 assume !(~n <= 0); 864775#L26 call #t~ret0 := fact(~n - 1);< 864912#factENTRY ~n := #in~n; 864914#L25 assume !(~n <= 0); 864775#L26 call #t~ret0 := fact(~n - 1);< 864912#factENTRY ~n := #in~n; 864914#L25 assume !(~n <= 0); 864775#L26 call #t~ret0 := fact(~n - 1);< 864912#factENTRY ~n := #in~n; 864916#L25 assume ~n <= 0;#res := 1; 864915#factFINAL assume true; 864911#factEXIT >#66#return; 864909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864908#factFINAL assume true; 864907#factEXIT >#66#return; 864905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864903#factFINAL assume true; 864891#factEXIT >#66#return; 864881#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864880#factFINAL assume true; 864879#factEXIT >#66#return; 864878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864877#factFINAL assume true; 864874#factEXIT >#66#return; 864873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864869#factFINAL assume true; 864865#factEXIT >#66#return; 864792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864793#factFINAL assume true; 864783#factEXIT >#66#return; 864786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865096#factFINAL assume true; 865095#factEXIT >#78#return; 864719#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; 864718#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 864717#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864716#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 864715#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 864714#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 864713#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864701#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; 864691#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864692#factENTRY ~n := #in~n; 864710#L25 assume !(~n <= 0); 864707#L26 call #t~ret0 := fact(~n - 1);< 864708#factENTRY ~n := #in~n; 864711#L25 assume ~n <= 0;#res := 1; 864709#factFINAL assume true; 864706#factEXIT >#66#return; 864703#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864700#factFINAL assume true; 864690#factEXIT >#68#return; 864579#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864687#factENTRY ~n := #in~n; 864698#L25 assume ~n <= 0;#res := 1; 864689#factFINAL assume true; 864559#factEXIT >#70#return; 864556#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864557#factENTRY ~n := #in~n; 864699#L25 assume !(~n <= 0); 864694#L26 call #t~ret0 := fact(~n - 1);< 864697#factENTRY ~n := #in~n; 864704#L25 assume ~n <= 0;#res := 1; 864702#factFINAL assume true; 864693#factEXIT >#66#return; 864688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864558#factFINAL assume true; 864555#factEXIT >#72#return; 864502#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; 864503#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864550#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864548#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864546#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; 864463#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864464#factENTRY ~n := #in~n; 864705#L25 assume !(~n <= 0); 864695#L26 call #t~ret0 := fact(~n - 1);< 864697#factENTRY ~n := #in~n; 864704#L25 assume ~n <= 0;#res := 1; 864702#factFINAL assume true; 864693#factEXIT >#66#return; 864696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866855#factFINAL assume true; 866853#factEXIT >#68#return; 866678#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866851#factENTRY ~n := #in~n; 866958#L25 assume !(~n <= 0); 864522#L26 call #t~ret0 := fact(~n - 1);< 866672#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866671#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866990#factFINAL assume true; 866850#factEXIT >#70#return; 866847#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866848#factENTRY ~n := #in~n; 867086#L25 assume ~n <= 0;#res := 1; 866989#factFINAL assume true; 866846#factEXIT >#72#return; 866839#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; 866834#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 866712#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866680#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 866676#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; 866590#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866655#factENTRY ~n := #in~n; 867107#L25 assume !(~n <= 0); 866698#L26 call #t~ret0 := fact(~n - 1);< 866988#factENTRY ~n := #in~n; 866963#L25 assume !(~n <= 0); 866695#L26 call #t~ret0 := fact(~n - 1);< 866843#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866673#factFINAL assume true; 866587#factEXIT >#74#return; 866400#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866584#factENTRY ~n := #in~n; 867527#L25 assume !(~n <= 0); 866663#L26 call #t~ret0 := fact(~n - 1);< 866713#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866583#factFINAL assume true; 866284#factEXIT >#76#return; 864534#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864535#factENTRY ~n := #in~n; 867930#L25 assume !(~n <= 0); 866663#L26 call #t~ret0 := fact(~n - 1);< 866713#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866583#factFINAL assume true; 866284#factEXIT >#78#return; 864475#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; 864476#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 871869#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 871868#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864509#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; 864510#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 869761#factENTRY ~n := #in~n; 869846#L25 assume !(~n <= 0); 869838#L26 call #t~ret0 := fact(~n - 1);< 869845#factENTRY ~n := #in~n; 871819#L25 assume !(~n <= 0); 869836#L26 call #t~ret0 := fact(~n - 1);< 869887#factENTRY ~n := #in~n; 871819#L25 assume !(~n <= 0); 869836#L26 call #t~ret0 := fact(~n - 1);< 869887#factENTRY ~n := #in~n; 869897#L25 assume ~n <= 0;#res := 1; 869896#factFINAL assume true; 869884#factEXIT >#66#return; 869882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869872#factFINAL assume true; 869852#factEXIT >#66#return; 869850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869847#factFINAL assume true; 869828#factEXIT >#66#return; 869827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869826#factFINAL assume true; 869758#factEXIT >#74#return; 869023#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 869449#factENTRY ~n := #in~n; 871647#L25 assume !(~n <= 0); 871163#L26 call #t~ret0 := fact(~n - 1);< 871181#factENTRY ~n := #in~n; 871462#L25 assume ~n <= 0;#res := 1; 871461#factFINAL assume true; 871319#factEXIT >#66#return; 871323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 871645#factFINAL assume true; 871644#factEXIT >#76#return; 871220#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 871642#factENTRY ~n := #in~n; 871641#L25 assume !(~n <= 0); 871164#L26 call #t~ret0 := fact(~n - 1);< 871222#factENTRY ~n := #in~n; 871234#L25 assume !(~n <= 0); 871230#L26 call #t~ret0 := fact(~n - 1);< 871233#factENTRY ~n := #in~n; 871237#L25 assume ~n <= 0;#res := 1; 871236#factFINAL assume true; 871229#factEXIT >#66#return; 871228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 871219#factFINAL assume true; 871159#factEXIT >#66#return; 871176#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 871830#factFINAL assume true; 871826#factEXIT >#78#return; 869185#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; 869183#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 869181#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 869179#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 868715#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; 868686#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 868758#factENTRY ~n := #in~n; 868759#L25 assume !(~n <= 0); 868739#L26 call #t~ret0 := fact(~n - 1);< 868740#factENTRY ~n := #in~n; 868771#L25 assume !(~n <= 0); 868748#L26 call #t~ret0 := fact(~n - 1);< 868763#factENTRY ~n := #in~n; 868771#L25 assume !(~n <= 0); 868748#L26 call #t~ret0 := fact(~n - 1);< 868763#factENTRY ~n := #in~n; 868771#L25 assume !(~n <= 0); 868748#L26 call #t~ret0 := fact(~n - 1);< 868763#factENTRY ~n := #in~n; 868771#L25 assume !(~n <= 0); 868748#L26 call #t~ret0 := fact(~n - 1);< 868763#factENTRY ~n := #in~n; 868771#L25 assume !(~n <= 0); 868748#L26 call #t~ret0 := fact(~n - 1);< 868763#factENTRY ~n := #in~n; 868771#L25 assume !(~n <= 0); 868748#L26 call #t~ret0 := fact(~n - 1);< 868763#factENTRY ~n := #in~n; 868849#L25 assume ~n <= 0;#res := 1; 868850#factFINAL assume true; 869020#factEXIT >#66#return; 869019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869018#factFINAL assume true; 868834#factEXIT >#66#return; 868833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868832#factFINAL assume true; 868793#factEXIT >#66#return; 868788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868785#factFINAL assume true; 868782#factEXIT >#66#return; 868778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868774#factFINAL assume true; 868775#factEXIT >#66#return; 868769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868770#factFINAL assume true; 868865#factEXIT >#66#return; 868757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868747#factFINAL assume true; 868749#factEXIT >#66#return; 868723#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868724#factFINAL assume true; 868683#factEXIT >#74#return; 868264#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 868682#factENTRY ~n := #in~n; 869404#L25 assume !(~n <= 0); 868224#L26 call #t~ret0 := fact(~n - 1);< 868228#factENTRY ~n := #in~n; 868268#L25 assume ~n <= 0;#res := 1; 868263#factFINAL assume true; 868219#factEXIT >#66#return; 868227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868697#factFINAL assume true; 868681#factEXIT >#76#return; 868074#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 868075#factENTRY ~n := #in~n; 868841#L25 assume !(~n <= 0); 868389#L26 call #t~ret0 := fact(~n - 1);< 868410#factENTRY ~n := #in~n; 868590#L25 assume !(~n <= 0); 868406#L26 call #t~ret0 := fact(~n - 1);< 868425#factENTRY ~n := #in~n; 868565#L25 assume !(~n <= 0); 868420#L26 call #t~ret0 := fact(~n - 1);< 868455#factENTRY ~n := #in~n; 868502#L25 assume !(~n <= 0); 868449#L26 call #t~ret0 := fact(~n - 1);< 868495#factENTRY ~n := #in~n; 868494#L25 assume !(~n <= 0); 868237#L26 call #t~ret0 := fact(~n - 1);< 868483#factENTRY ~n := #in~n; 869353#L25 assume !(~n <= 0); 868238#L26 call #t~ret0 := fact(~n - 1);< 868348#factENTRY ~n := #in~n; 868357#L25 assume ~n <= 0;#res := 1; 868355#factFINAL assume true; 868346#factEXIT >#66#return; 868342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868334#factFINAL assume true; 868229#factEXIT >#66#return; 868248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868522#factFINAL assume true; 868506#factEXIT >#66#return; 868505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868496#factFINAL assume true; 868476#factEXIT >#66#return; 868475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868460#factFINAL assume true; 868444#factEXIT >#66#return; 868442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868433#factFINAL assume true; 868417#factEXIT >#66#return; 868423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869316#factFINAL assume true; 869301#factEXIT >#78#return; 867027#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; 867025#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 866955#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866953#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 866950#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 866948#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 866943#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 866933#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; 866928#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866929#factENTRY ~n := #in~n; 866947#L25 assume !(~n <= 0); 866938#L26 call #t~ret0 := fact(~n - 1);< 866942#factENTRY ~n := #in~n; 864712#L25 assume !(~n <= 0); 866937#L26 call #t~ret0 := fact(~n - 1);< 866952#factENTRY ~n := #in~n; 866956#L25 assume ~n <= 0;#res := 1; 866954#factFINAL assume true; 866951#factEXIT >#66#return; 866949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866944#factFINAL assume true; 866936#factEXIT >#66#return; 866932#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866931#factFINAL assume true; 866927#factEXIT >#68#return; 864616#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864687#factENTRY ~n := #in~n; 864698#L25 assume ~n <= 0;#res := 1; 864689#factFINAL assume true; 864559#factEXIT >#70#return; 864679#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866923#factENTRY ~n := #in~n; 866935#L25 assume !(~n <= 0); 866700#L26 call #t~ret0 := fact(~n - 1);< 866930#factENTRY ~n := #in~n; 872034#L25 assume !(~n <= 0); 864523#L26 call #t~ret0 := fact(~n - 1);< 866841#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866926#factFINAL assume true; 866922#factEXIT >#72#return; 866905#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; 866903#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 866901#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866899#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 866897#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; 866591#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866674#factENTRY ~n := #in~n; 867264#L25 assume !(~n <= 0); 864466#L26 call #t~ret0 := fact(~n - 1);< 864465#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866673#factFINAL assume true; 866587#factEXIT >#68#return; 866286#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866894#factENTRY ~n := #in~n; 867096#L25 assume !(~n <= 0); 864518#L26 call #t~ret0 := fact(~n - 1);< 866672#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866583#factFINAL assume true; 866284#factEXIT >#70#return; 866512#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866921#factENTRY ~n := #in~n; 866934#L25 assume !(~n <= 0); 866658#L26 call #t~ret0 := fact(~n - 1);< 866713#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866924#factFINAL assume true; 866906#factEXIT >#72#return; 866904#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; 866902#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 866900#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866898#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 866896#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; 866588#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866674#factENTRY ~n := #in~n; 867264#L25 assume !(~n <= 0); 864466#L26 call #t~ret0 := fact(~n - 1);< 864465#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866673#factFINAL assume true; 866587#factEXIT >#68#return; 866289#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866894#factENTRY ~n := #in~n; 867096#L25 assume !(~n <= 0); 864518#L26 call #t~ret0 := fact(~n - 1);< 866672#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866673#factFINAL assume true; 866587#factEXIT >#70#return; 866596#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866892#factENTRY ~n := #in~n; 866895#L25 assume ~n <= 0;#res := 1; 866893#factFINAL assume true; 866857#factEXIT >#72#return; 866856#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; 866854#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 866852#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866849#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 866845#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; 866735#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866833#factENTRY ~n := #in~n; 867106#L25 assume !(~n <= 0); 866696#L26 call #t~ret0 := fact(~n - 1);< 866988#factENTRY ~n := #in~n; 866963#L25 assume !(~n <= 0); 866695#L26 call #t~ret0 := fact(~n - 1);< 866843#factENTRY ~n := #in~n; 866963#L25 assume !(~n <= 0); 866695#L26 call #t~ret0 := fact(~n - 1);< 866843#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866836#factFINAL assume true; 866728#factEXIT >#74#return; 866589#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866675#factENTRY ~n := #in~n; 867266#L25 assume !(~n <= 0); 864519#L26 call #t~ret0 := fact(~n - 1);< 866672#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866673#factFINAL assume true; 866587#factEXIT >#76#return; 866329#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866585#factENTRY ~n := #in~n; 872033#L25 assume !(~n <= 0); 864517#L26 call #t~ret0 := fact(~n - 1);< 866672#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866583#factFINAL assume true; 866284#factEXIT >#78#return; 866569#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; 869333#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 869334#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 871718#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 868332#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; 868333#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 869761#factENTRY ~n := #in~n; 869846#L25 assume !(~n <= 0); 869838#L26 call #t~ret0 := fact(~n - 1);< 869845#factENTRY ~n := #in~n; 871819#L25 assume !(~n <= 0); 869836#L26 call #t~ret0 := fact(~n - 1);< 869887#factENTRY ~n := #in~n; 871819#L25 assume !(~n <= 0); 869836#L26 call #t~ret0 := fact(~n - 1);< 869887#factENTRY ~n := #in~n; 869897#L25 assume ~n <= 0;#res := 1; 869896#factFINAL assume true; 869884#factEXIT >#66#return; 869882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869872#factFINAL assume true; 869852#factEXIT >#66#return; 869850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869847#factFINAL assume true; 869828#factEXIT >#66#return; 869827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869826#factFINAL assume true; 869758#factEXIT >#74#return; 869022#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 869448#factENTRY ~n := #in~n; 870674#L25 assume !(~n <= 0); 869525#L26 call #t~ret0 := fact(~n - 1);< 869535#factENTRY ~n := #in~n; 869539#L25 assume !(~n <= 0); 869779#L26 call #t~ret0 := fact(~n - 1);< 869782#factENTRY ~n := #in~n; 869946#L25 assume ~n <= 0;#res := 1; 869945#factFINAL assume true; 869778#factEXIT >#66#return; 869776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869728#factFINAL assume true; 869662#factEXIT >#66#return; 869684#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 871566#factFINAL assume true; 871565#factEXIT >#76#return; 869950#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 871564#factENTRY ~n := #in~n; 871561#L25 assume !(~n <= 0); 869673#L26 call #t~ret0 := fact(~n - 1);< 869949#factENTRY ~n := #in~n; 869539#L25 assume !(~n <= 0); 869779#L26 call #t~ret0 := fact(~n - 1);< 869782#factENTRY ~n := #in~n; 869946#L25 assume ~n <= 0;#res := 1; 869945#factFINAL assume true; 869778#factEXIT >#66#return; 869776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869728#factFINAL assume true; 869662#factEXIT >#66#return; 869687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 871934#factFINAL assume true; 871927#factEXIT >#78#return; 868643#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; 871928#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 871926#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 871925#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 869307#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; 868051#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864436#factENTRY ~n := #in~n; 868385#L25 assume !(~n <= 0); 868108#L26 call #t~ret0 := fact(~n - 1);< 868257#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868357#L25 assume ~n <= 0;#res := 1; 868355#factFINAL assume true; 868346#factEXIT >#66#return; 868342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868334#factFINAL assume true; 868229#factEXIT >#66#return; 868248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868522#factFINAL assume true; 868506#factEXIT >#66#return; 868505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868496#factFINAL assume true; 868476#factEXIT >#66#return; 868475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868460#factFINAL assume true; 868444#factEXIT >#66#return; 868442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868433#factFINAL assume true; 868417#factEXIT >#66#return; 868416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868413#factFINAL assume true; 868402#factEXIT >#66#return; 868400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868397#factFINAL assume true; 868386#factEXIT >#66#return; 868171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868162#factFINAL assume true; 868152#factEXIT >#66#return; 868151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868149#factFINAL assume true; 868146#factEXIT >#66#return; 868147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868472#factFINAL assume true; 868471#factEXIT >#74#return; 868066#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 868207#factENTRY ~n := #in~n; 868327#L25 assume !(~n <= 0); 868220#L26 call #t~ret0 := fact(~n - 1);< 868228#factENTRY ~n := #in~n; 868270#L25 assume !(~n <= 0); 868347#L26 call #t~ret0 := fact(~n - 1);< 868350#factENTRY ~n := #in~n; 868357#L25 assume ~n <= 0;#res := 1; 868355#factFINAL assume true; 868346#factEXIT >#66#return; 868342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868334#factFINAL assume true; 868229#factEXIT >#66#return; 868217#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868212#factFINAL assume true; 868061#factEXIT >#76#return; 868071#L30-7 [2022-11-18 20:36:11,157 INFO L750 eck$LassoCheckResult]: Loop: 868071#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 868411#factENTRY ~n := #in~n; 868401#L25 assume !(~n <= 0); 868154#L26 call #t~ret0 := fact(~n - 1);< 868398#factENTRY ~n := #in~n; 868412#L25 assume !(~n <= 0); 868390#L26 call #t~ret0 := fact(~n - 1);< 868410#factENTRY ~n := #in~n; 868590#L25 assume !(~n <= 0); 868406#L26 call #t~ret0 := fact(~n - 1);< 868425#factENTRY ~n := #in~n; 868565#L25 assume !(~n <= 0); 868420#L26 call #t~ret0 := fact(~n - 1);< 868455#factENTRY ~n := #in~n; 868502#L25 assume !(~n <= 0); 868449#L26 call #t~ret0 := fact(~n - 1);< 868495#factENTRY ~n := #in~n; 868494#L25 assume !(~n <= 0); 868237#L26 call #t~ret0 := fact(~n - 1);< 868483#factENTRY ~n := #in~n; 869353#L25 assume !(~n <= 0); 868238#L26 call #t~ret0 := fact(~n - 1);< 868348#factENTRY ~n := #in~n; 868492#L25 assume !(~n <= 0); 868245#L26 call #t~ret0 := fact(~n - 1);< 868490#factENTRY ~n := #in~n; 868357#L25 assume ~n <= 0;#res := 1; 868355#factFINAL assume true; 868346#factEXIT >#66#return; 868342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868334#factFINAL assume true; 868229#factEXIT >#66#return; 868248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868522#factFINAL assume true; 868506#factEXIT >#66#return; 868505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868496#factFINAL assume true; 868476#factEXIT >#66#return; 868475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868460#factFINAL assume true; 868444#factEXIT >#66#return; 868442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868433#factFINAL assume true; 868417#factEXIT >#66#return; 868416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868413#factFINAL assume true; 868402#factEXIT >#66#return; 868400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868397#factFINAL assume true; 868386#factEXIT >#66#return; 868393#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869416#factFINAL assume true; 868091#factEXIT >#78#return; 867035#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; 870317#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 870316#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 870315#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 864504#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 864495#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 864496#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 867931#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; 867013#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 867022#factENTRY ~n := #in~n; 867020#L25 assume !(~n <= 0); 866939#L26 call #t~ret0 := fact(~n - 1);< 866942#factENTRY ~n := #in~n; 864712#L25 assume !(~n <= 0); 866937#L26 call #t~ret0 := fact(~n - 1);< 866952#factENTRY ~n := #in~n; 864712#L25 assume !(~n <= 0); 866937#L26 call #t~ret0 := fact(~n - 1);< 866952#factENTRY ~n := #in~n; 866956#L25 assume ~n <= 0;#res := 1; 866954#factFINAL assume true; 866951#factEXIT >#66#return; 866949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866944#factFINAL assume true; 866936#factEXIT >#66#return; 866941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867666#factFINAL assume true; 867664#factEXIT >#66#return; 867665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867764#factFINAL assume true; 867752#factEXIT >#68#return; 864623#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864687#factENTRY ~n := #in~n; 864698#L25 assume ~n <= 0;#res := 1; 864689#factFINAL assume true; 864559#factEXIT >#70#return; 864686#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 867676#factENTRY ~n := #in~n; 867679#L25 assume !(~n <= 0); 866966#L26 call #t~ret0 := fact(~n - 1);< 867272#factENTRY ~n := #in~n; 867268#L25 assume !(~n <= 0); 864468#L26 call #t~ret0 := fact(~n - 1);< 864465#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867675#factFINAL assume true; 867644#factEXIT >#72#return; 867645#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; 871757#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 871756#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 867888#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 867867#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; 866756#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866837#factENTRY ~n := #in~n; 867835#L25 assume !(~n <= 0); 866972#L26 call #t~ret0 := fact(~n - 1);< 867269#factENTRY ~n := #in~n; 867270#L25 assume !(~n <= 0); 864524#L26 call #t~ret0 := fact(~n - 1);< 866841#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866836#factFINAL assume true; 866728#factEXIT >#68#return; 866402#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 867103#factENTRY ~n := #in~n; 867102#L25 assume ~n <= 0;#res := 1; 867097#factFINAL assume true; 867404#factEXIT >#70#return; 867203#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 867700#factENTRY ~n := #in~n; 867907#L25 assume !(~n <= 0); 866965#L26 call #t~ret0 := fact(~n - 1);< 867272#factENTRY ~n := #in~n; 867268#L25 assume !(~n <= 0); 864468#L26 call #t~ret0 := fact(~n - 1);< 864465#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867699#factFINAL assume true; 867197#factEXIT >#72#return; 864501#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; 864497#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864498#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864513#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864507#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; 864508#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866837#factENTRY ~n := #in~n; 867835#L25 assume !(~n <= 0); 866972#L26 call #t~ret0 := fact(~n - 1);< 867269#factENTRY ~n := #in~n; 867270#L25 assume !(~n <= 0); 864524#L26 call #t~ret0 := fact(~n - 1);< 866841#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866836#factFINAL assume true; 866728#factEXIT >#68#return; 866411#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 867103#factENTRY ~n := #in~n; 867102#L25 assume !(~n <= 0); 866664#L26 call #t~ret0 := fact(~n - 1);< 866986#factENTRY ~n := #in~n; 867396#L25 assume !(~n <= 0); 864520#L26 call #t~ret0 := fact(~n - 1);< 866841#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866673#factFINAL assume true; 866587#factEXIT >#70#return; 866608#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 867341#factENTRY ~n := #in~n; 867350#L25 assume !(~n <= 0); 864521#L26 call #t~ret0 := fact(~n - 1);< 866672#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866924#factFINAL assume true; 866906#factEXIT >#72#return; 866908#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; 870970#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 870969#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 870968#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 870967#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; 866781#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866837#factENTRY ~n := #in~n; 867835#L25 assume !(~n <= 0); 866972#L26 call #t~ret0 := fact(~n - 1);< 867269#factENTRY ~n := #in~n; 867270#L25 assume !(~n <= 0); 864524#L26 call #t~ret0 := fact(~n - 1);< 866841#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866836#factFINAL assume true; 866728#factEXIT >#68#return; 866442#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 867103#factENTRY ~n := #in~n; 867102#L25 assume !(~n <= 0); 866664#L26 call #t~ret0 := fact(~n - 1);< 866986#factENTRY ~n := #in~n; 867396#L25 assume !(~n <= 0); 864520#L26 call #t~ret0 := fact(~n - 1);< 866841#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866836#factFINAL assume true; 866728#factEXIT >#70#return; 866809#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866892#factENTRY ~n := #in~n; 866895#L25 assume ~n <= 0;#res := 1; 866893#factFINAL assume true; 866857#factEXIT >#72#return; 866891#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; 870966#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 870965#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 870964#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 870963#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; 867078#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 867108#factENTRY ~n := #in~n; 867104#L25 assume !(~n <= 0); 866683#L26 call #t~ret0 := fact(~n - 1);< 866988#factENTRY ~n := #in~n; 866963#L25 assume !(~n <= 0); 866695#L26 call #t~ret0 := fact(~n - 1);< 866843#factENTRY ~n := #in~n; 866963#L25 assume !(~n <= 0); 866695#L26 call #t~ret0 := fact(~n - 1);< 866843#factENTRY ~n := #in~n; 866963#L25 assume !(~n <= 0); 866695#L26 call #t~ret0 := fact(~n - 1);< 866843#factENTRY ~n := #in~n; 866963#L25 assume !(~n <= 0); 866695#L26 call #t~ret0 := fact(~n - 1);< 866843#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867685#factFINAL assume true; 867615#factEXIT >#66#return; 867614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867607#factFINAL assume true; 867541#factEXIT >#66#return; 867545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867909#factFINAL assume true; 867084#factEXIT >#74#return; 866785#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866838#factENTRY ~n := #in~n; 867837#L25 assume !(~n <= 0); 866968#L26 call #t~ret0 := fact(~n - 1);< 867272#factENTRY ~n := #in~n; 867268#L25 assume !(~n <= 0); 864468#L26 call #t~ret0 := fact(~n - 1);< 864465#factENTRY ~n := #in~n; 864467#L25 assume !(~n <= 0); 864516#L26 call #t~ret0 := fact(~n - 1);< 866842#factENTRY ~n := #in~n; 866959#L25 assume ~n <= 0;#res := 1; 866957#factFINAL assume true; 866840#factEXIT >#66#return; 866835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866714#factFINAL assume true; 866682#factEXIT >#66#return; 866710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 867064#factFINAL assume true; 866964#factEXIT >#66#return; 866844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866836#factFINAL assume true; 866728#factEXIT >#76#return; 866497#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866585#factENTRY ~n := #in~n; 872033#L25 assume !(~n <= 0); 864517#L26 call #t~ret0 := fact(~n - 1);< 866672#factENTRY ~n := #in~n; 866681#L25 assume ~n <= 0;#res := 1; 866677#factFINAL assume true; 866656#factEXIT >#66#return; 866586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866583#factFINAL assume true; 866284#factEXIT >#78#return; 866548#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; 870962#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 870960#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 870914#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 869511#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; 869289#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 869298#factENTRY ~n := #in~n; 871854#L25 assume !(~n <= 0); 870227#L26 call #t~ret0 := fact(~n - 1);< 870403#factENTRY ~n := #in~n; 871281#L25 assume !(~n <= 0); 870223#L26 call #t~ret0 := fact(~n - 1);< 871006#factENTRY ~n := #in~n; 871281#L25 assume !(~n <= 0); 870223#L26 call #t~ret0 := fact(~n - 1);< 871006#factENTRY ~n := #in~n; 871281#L25 assume !(~n <= 0); 870223#L26 call #t~ret0 := fact(~n - 1);< 871006#factENTRY ~n := #in~n; 871281#L25 assume !(~n <= 0); 870223#L26 call #t~ret0 := fact(~n - 1);< 871006#factENTRY ~n := #in~n; 871093#L25 assume ~n <= 0;#res := 1; 871389#factFINAL assume true; 870999#factEXIT >#66#return; 870998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 870615#factFINAL assume true; 870326#factEXIT >#66#return; 870338#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 870704#factFINAL assume true; 870438#factEXIT >#66#return; 870437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 870431#factFINAL assume true; 870218#factEXIT >#66#return; 870255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 870635#factFINAL assume true; 870366#factEXIT >#66#return; 870355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 870051#factFINAL assume true; 870044#factEXIT >#74#return; 869295#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 870518#factENTRY ~n := #in~n; 870741#L25 assume !(~n <= 0); 869792#L26 call #t~ret0 := fact(~n - 1);< 869802#factENTRY ~n := #in~n; 869966#L25 assume !(~n <= 0); 869674#L26 call #t~ret0 := fact(~n - 1);< 869949#factENTRY ~n := #in~n; 869539#L25 assume !(~n <= 0); 869779#L26 call #t~ret0 := fact(~n - 1);< 869782#factENTRY ~n := #in~n; 869946#L25 assume ~n <= 0;#res := 1; 869945#factFINAL assume true; 869778#factEXIT >#66#return; 869776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869728#factFINAL assume true; 869662#factEXIT >#66#return; 869683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869961#factFINAL assume true; 869784#factEXIT >#66#return; 869801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 870740#factFINAL assume true; 870514#factEXIT >#76#return; 868642#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 868647#factENTRY ~n := #in~n; 870410#L25 assume !(~n <= 0); 869672#L26 call #t~ret0 := fact(~n - 1);< 869949#factENTRY ~n := #in~n; 869539#L25 assume !(~n <= 0); 869779#L26 call #t~ret0 := fact(~n - 1);< 869782#factENTRY ~n := #in~n; 869946#L25 assume ~n <= 0;#res := 1; 869945#factFINAL assume true; 869778#factEXIT >#66#return; 869776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 869728#factFINAL assume true; 869662#factEXIT >#66#return; 869686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 870404#factFINAL assume true; 868636#factEXIT >#78#return; 868645#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; 870511#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 870463#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 870461#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 870460#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; 868020#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864436#factENTRY ~n := #in~n; 868385#L25 assume !(~n <= 0); 868108#L26 call #t~ret0 := fact(~n - 1);< 868257#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868358#L25 assume !(~n <= 0); 868106#L26 call #t~ret0 := fact(~n - 1);< 868349#factENTRY ~n := #in~n; 868357#L25 assume ~n <= 0;#res := 1; 868355#factFINAL assume true; 868346#factEXIT >#66#return; 868342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868334#factFINAL assume true; 868229#factEXIT >#66#return; 868248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868522#factFINAL assume true; 868506#factEXIT >#66#return; 868505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868496#factFINAL assume true; 868476#factEXIT >#66#return; 868475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868460#factFINAL assume true; 868444#factEXIT >#66#return; 868442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868433#factFINAL assume true; 868417#factEXIT >#66#return; 868416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868413#factFINAL assume true; 868402#factEXIT >#66#return; 868400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868397#factFINAL assume true; 868386#factEXIT >#66#return; 868171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868162#factFINAL assume true; 868152#factEXIT >#66#return; 868151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868149#factFINAL assume true; 868146#factEXIT >#66#return; 868147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868472#factFINAL assume true; 868471#factEXIT >#74#return; 868052#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 868615#factENTRY ~n := #in~n; 868616#L25 assume !(~n <= 0); 868510#L26 call #t~ret0 := fact(~n - 1);< 864482#factENTRY ~n := #in~n; 868609#L25 assume !(~n <= 0); 868231#L26 call #t~ret0 := fact(~n - 1);< 868489#factENTRY ~n := #in~n; 868270#L25 assume !(~n <= 0); 868347#L26 call #t~ret0 := fact(~n - 1);< 868350#factENTRY ~n := #in~n; 868357#L25 assume ~n <= 0;#res := 1; 868355#factFINAL assume true; 868346#factEXIT >#66#return; 868342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868334#factFINAL assume true; 868229#factEXIT >#66#return; 868248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868522#factFINAL assume true; 868506#factEXIT >#66#return; 868513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 868614#factFINAL assume true; 868208#factEXIT >#76#return; 868071#L30-7 [2022-11-18 20:36:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -435666148, now seen corresponding path program 58 times [2022-11-18 20:36:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:11,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476374945] [2022-11-18 20:36:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:11,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:11,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968647326] [2022-11-18 20:36:11,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:36:11,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:11,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:11,198 INFO L229 MonitoredProcess]: Starting monitored process 327 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:11,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (327)] Waiting until timeout for monitored process [2022-11-18 20:36:13,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:36:13,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:13,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:36:13,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 44491 backedges. 18709 proven. 79 refuted. 0 times theorem prover too weak. 25703 trivial. 0 not checked. [2022-11-18 20:36:14,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 44491 backedges. 975 proven. 2200 refuted. 0 times theorem prover too weak. 41316 trivial. 0 not checked. [2022-11-18 20:36:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476374945] [2022-11-18 20:36:15,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968647326] [2022-11-18 20:36:15,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968647326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:15,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:15,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 26 [2022-11-18 20:36:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888820857] [2022-11-18 20:36:15,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:15,935 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:36:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash -392394911, now seen corresponding path program 42 times [2022-11-18 20:36:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:15,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459956610] [2022-11-18 20:36:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:15,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:15,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757327884] [2022-11-18 20:36:15,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:36:15,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:15,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:15,980 INFO L229 MonitoredProcess]: Starting monitored process 328 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:15,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (328)] Waiting until timeout for monitored process [2022-11-18 20:36:18,256 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-11-18 20:36:18,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:18,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:36:18,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18427 backedges. 7431 proven. 2 refuted. 0 times theorem prover too weak. 10994 trivial. 0 not checked. [2022-11-18 20:36:18,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18427 backedges. 129 proven. 188 refuted. 0 times theorem prover too weak. 18110 trivial. 0 not checked. [2022-11-18 20:36:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:19,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459956610] [2022-11-18 20:36:19,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:19,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757327884] [2022-11-18 20:36:19,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757327884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:19,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:19,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-18 20:36:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349405771] [2022-11-18 20:36:19,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:19,055 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:36:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:36:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:36:19,055 INFO L87 Difference]: Start difference. First operand 7601 states and 16332 transitions. cyclomatic complexity: 8797 Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-18 20:36:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:19,306 INFO L93 Difference]: Finished difference Result 7533 states and 15997 transitions. [2022-11-18 20:36:19,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7533 states and 15997 transitions. [2022-11-18 20:36:19,387 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1304 [2022-11-18 20:36:19,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7533 states to 7531 states and 15991 transitions. [2022-11-18 20:36:19,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2567 [2022-11-18 20:36:19,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2567 [2022-11-18 20:36:19,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7531 states and 15991 transitions. [2022-11-18 20:36:19,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:36:19,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7531 states and 15991 transitions. [2022-11-18 20:36:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7531 states and 15991 transitions. [2022-11-18 20:36:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7531 to 7524. [2022-11-18 20:36:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7524 states, 4307 states have (on average 1.0387740886928256) internal successors, (4474), 4288 states have internal predecessors, (4474), 2440 states have call successors, (2541), 995 states have call predecessors, (2541), 777 states have return successors, (8933), 2240 states have call predecessors, (8933), 2440 states have call successors, (8933) [2022-11-18 20:36:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7524 states to 7524 states and 15948 transitions. [2022-11-18 20:36:19,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7524 states and 15948 transitions. [2022-11-18 20:36:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:36:19,751 INFO L428 stractBuchiCegarLoop]: Abstraction has 7524 states and 15948 transitions. [2022-11-18 20:36:19,751 INFO L335 stractBuchiCegarLoop]: ======== Iteration 75 ============ [2022-11-18 20:36:19,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7524 states and 15948 transitions. [2022-11-18 20:36:19,790 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1304 [2022-11-18 20:36:19,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:36:19,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:36:19,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [138, 138, 91, 91, 91, 91, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:36:19,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [87, 87, 66, 66, 66, 66, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:36:19,796 INFO L748 eck$LassoCheckResult]: Stem: 887941#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 887915#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; 887916#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 887940#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; 887967#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 887978#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 887976#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; 887974#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 887975#factENTRY ~n := #in~n; 887983#L25 assume ~n <= 0;#res := 1; 887981#factFINAL assume true; 887973#factEXIT >#68#return; 887960#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 887961#factENTRY ~n := #in~n; 887979#L25 assume ~n <= 0;#res := 1; 887977#factFINAL assume true; 887972#factEXIT >#70#return; 887882#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 887883#factENTRY ~n := #in~n; 887988#L25 assume ~n <= 0;#res := 1; 887987#factFINAL assume true; 887986#factEXIT >#72#return; 887985#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; 887934#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 887935#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 888918#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 888916#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; 888913#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 888914#factENTRY ~n := #in~n; 888971#L25 assume !(~n <= 0); 888969#L26 call #t~ret0 := fact(~n - 1);< 888970#factENTRY ~n := #in~n; 888975#L25 assume ~n <= 0;#res := 1; 888973#factFINAL assume true; 888968#factEXIT >#66#return; 888967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888966#factFINAL assume true; 888912#factEXIT >#74#return; 888898#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 888899#factENTRY ~n := #in~n; 888906#L25 assume ~n <= 0;#res := 1; 888905#factFINAL assume true; 888897#factEXIT >#76#return; 888894#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 888895#factENTRY ~n := #in~n; 888956#L25 assume !(~n <= 0); 888953#L26 call #t~ret0 := fact(~n - 1);< 888954#factENTRY ~n := #in~n; 888958#L25 assume ~n <= 0;#res := 1; 888957#factFINAL assume true; 888952#factEXIT >#66#return; 888910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888909#factFINAL assume true; 888893#factEXIT >#78#return; 888891#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; 888890#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 888885#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 888881#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 888874#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; 888866#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 888867#factENTRY ~n := #in~n; 888884#L25 assume !(~n <= 0); 888879#L26 call #t~ret0 := fact(~n - 1);< 888880#factENTRY ~n := #in~n; 888900#L25 assume !(~n <= 0); 888878#L26 call #t~ret0 := fact(~n - 1);< 888889#factENTRY ~n := #in~n; 888896#L25 assume ~n <= 0;#res := 1; 888892#factFINAL assume true; 888888#factEXIT >#66#return; 888887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888883#factFINAL assume true; 888877#factEXIT >#66#return; 888873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888872#factFINAL assume true; 888865#factEXIT >#74#return; 888843#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 888844#factENTRY ~n := #in~n; 888846#L25 assume ~n <= 0;#res := 1; 888845#factFINAL assume true; 888842#factEXIT >#76#return; 888817#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 888841#factENTRY ~n := #in~n; 888840#L25 assume !(~n <= 0); 888768#L26 call #t~ret0 := fact(~n - 1);< 888773#factENTRY ~n := #in~n; 888838#L25 assume !(~n <= 0); 888769#L26 call #t~ret0 := fact(~n - 1);< 888826#factENTRY ~n := #in~n; 888835#L25 assume ~n <= 0;#res := 1; 888833#factFINAL assume true; 888825#factEXIT >#66#return; 888820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888816#factFINAL assume true; 888787#factEXIT >#66#return; 888788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 889068#factFINAL assume true; 889067#factEXIT >#78#return; 889066#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; 889064#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 889061#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 889058#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 889056#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; 888756#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 888757#factENTRY ~n := #in~n; 888774#L25 assume !(~n <= 0); 888767#L26 call #t~ret0 := fact(~n - 1);< 888773#factENTRY ~n := #in~n; 888838#L25 assume !(~n <= 0); 888769#L26 call #t~ret0 := fact(~n - 1);< 888826#factENTRY ~n := #in~n; 888838#L25 assume !(~n <= 0); 888769#L26 call #t~ret0 := fact(~n - 1);< 888826#factENTRY ~n := #in~n; 888835#L25 assume ~n <= 0;#res := 1; 888833#factFINAL assume true; 888825#factEXIT >#66#return; 888820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888816#factFINAL assume true; 888787#factEXIT >#66#return; 888785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888775#factFINAL assume true; 888762#factEXIT >#66#return; 888760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888758#factFINAL assume true; 888755#factEXIT >#74#return; 888545#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 888751#factENTRY ~n := #in~n; 889055#L25 assume ~n <= 0;#res := 1; 889053#factFINAL assume true; 889051#factEXIT >#76#return; 888848#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 889050#factENTRY ~n := #in~n; 889048#L25 assume !(~n <= 0); 888705#L26 call #t~ret0 := fact(~n - 1);< 888829#factENTRY ~n := #in~n; 888863#L25 assume !(~n <= 0); 888711#L26 call #t~ret0 := fact(~n - 1);< 888716#factENTRY ~n := #in~n; 888858#L25 assume !(~n <= 0); 888704#L26 call #t~ret0 := fact(~n - 1);< 888857#factENTRY ~n := #in~n; 888861#L25 assume ~n <= 0;#res := 1; 888859#factFINAL assume true; 888856#factEXIT >#66#return; 888855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888854#factFINAL assume true; 888852#factEXIT >#66#return; 888850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888847#factFINAL assume true; 888827#factEXIT >#66#return; 888715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 889054#factFINAL assume true; 889052#factEXIT >#78#return; 888181#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; 888180#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 888179#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 888178#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 888175#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; 888177#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 888391#factENTRY ~n := #in~n; 888400#L25 assume !(~n <= 0); 888397#L26 call #t~ret0 := fact(~n - 1);< 888398#factENTRY ~n := #in~n; 888431#L25 assume !(~n <= 0); 888396#L26 call #t~ret0 := fact(~n - 1);< 888425#factENTRY ~n := #in~n; 888431#L25 assume !(~n <= 0); 888396#L26 call #t~ret0 := fact(~n - 1);< 888425#factENTRY ~n := #in~n; 888431#L25 assume !(~n <= 0); 888396#L26 call #t~ret0 := fact(~n - 1);< 888425#factENTRY ~n := #in~n; 888431#L25 assume !(~n <= 0); 888396#L26 call #t~ret0 := fact(~n - 1);< 888425#factENTRY ~n := #in~n; 888431#L25 assume !(~n <= 0); 888396#L26 call #t~ret0 := fact(~n - 1);< 888425#factENTRY ~n := #in~n; 888518#L25 assume ~n <= 0;#res := 1; 888517#factFINAL assume true; 888514#factEXIT >#66#return; 888513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888511#factFINAL assume true; 888505#factEXIT >#66#return; 888503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888480#factFINAL assume true; 888477#factEXIT >#66#return; 888474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888471#factFINAL assume true; 888468#factEXIT >#66#return; 888430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888429#factFINAL assume true; 888424#factEXIT >#66#return; 888423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888422#factFINAL assume true; 888395#factEXIT >#66#return; 888394#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888393#factFINAL assume true; 888390#factEXIT >#74#return; 888387#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 888388#factENTRY ~n := #in~n; 888421#L25 assume ~n <= 0;#res := 1; 888399#factFINAL assume true; 888385#factEXIT >#76#return; 888377#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 888382#factENTRY ~n := #in~n; 888380#L25 assume !(~n <= 0); 888209#L26 call #t~ret0 := fact(~n - 1);< 888367#factENTRY ~n := #in~n; 888373#L25 assume !(~n <= 0); 888191#L26 call #t~ret0 := fact(~n - 1);< 888255#factENTRY ~n := #in~n; 888389#L25 assume !(~n <= 0); 888190#L26 call #t~ret0 := fact(~n - 1);< 888228#factENTRY ~n := #in~n; 888384#L25 assume !(~n <= 0); 888192#L26 call #t~ret0 := fact(~n - 1);< 888379#factENTRY ~n := #in~n; 888384#L25 assume !(~n <= 0); 888192#L26 call #t~ret0 := fact(~n - 1);< 888379#factENTRY ~n := #in~n; 888384#L25 assume !(~n <= 0); 888192#L26 call #t~ret0 := fact(~n - 1);< 888379#factENTRY ~n := #in~n; 888384#L25 assume !(~n <= 0); 888192#L26 call #t~ret0 := fact(~n - 1);< 888379#factENTRY ~n := #in~n; 888383#L25 assume ~n <= 0;#res := 1; 888381#factFINAL assume true; 888378#factEXIT >#66#return; 888376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888375#factFINAL assume true; 888372#factEXIT >#66#return; 888371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888254#factFINAL assume true; 888186#factEXIT >#66#return; 888195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888369#factFINAL assume true; 888366#factEXIT >#66#return; 888365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888364#factFINAL assume true; 888360#factEXIT >#66#return; 888266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888264#factFINAL assume true; 888261#factEXIT >#66#return; 888258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888253#factFINAL assume true; 888251#factEXIT >#66#return; 888224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888435#factFINAL assume true; 888433#factEXIT >#78#return; 888153#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; 888151#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 888149#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 888146#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 888145#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 888144#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 888138#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 888135#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; 888125#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 888126#factENTRY ~n := #in~n; 888148#L25 assume !(~n <= 0); 888142#L26 call #t~ret0 := fact(~n - 1);< 888143#factENTRY ~n := #in~n; 888150#L25 assume ~n <= 0;#res := 1; 888147#factFINAL assume true; 888141#factEXIT >#66#return; 888137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 888134#factFINAL assume true; 888124#factEXIT >#68#return; 888035#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 888121#factENTRY ~n := #in~n; 888132#L25 assume ~n <= 0;#res := 1; 888123#factFINAL assume true; 887993#factEXIT >#70#return; 887990#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 887991#factENTRY ~n := #in~n; 888133#L25 assume !(~n <= 0); 888129#L26 call #t~ret0 := fact(~n - 1);< 888131#factENTRY ~n := #in~n; 888139#L25 assume ~n <= 0;#res := 1; 888136#factFINAL assume true; 888127#factEXIT >#66#return; 888122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887992#factFINAL assume true; 887989#factEXIT >#72#return; 887937#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; 887938#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 887984#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 887982#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 887980#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; 887886#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 887887#factENTRY ~n := #in~n; 888140#L25 assume !(~n <= 0); 888128#L26 call #t~ret0 := fact(~n - 1);< 888131#factENTRY ~n := #in~n; 888139#L25 assume ~n <= 0;#res := 1; 888136#factFINAL assume true; 888127#factEXIT >#66#return; 888130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890436#factFINAL assume true; 890405#factEXIT >#68#return; 890110#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890403#factENTRY ~n := #in~n; 890511#L25 assume !(~n <= 0); 890101#L26 call #t~ret0 := fact(~n - 1);< 890104#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890103#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890434#factFINAL assume true; 890402#factEXIT >#70#return; 890283#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890284#factENTRY ~n := #in~n; 890382#L25 assume ~n <= 0;#res := 1; 890380#factFINAL assume true; 890282#factEXIT >#72#return; 890278#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; 890271#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 890269#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 890227#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 890108#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; 890015#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890082#factENTRY ~n := #in~n; 890372#L25 assume !(~n <= 0); 890260#L26 call #t~ret0 := fact(~n - 1);< 890316#factENTRY ~n := #in~n; 890313#L25 assume !(~n <= 0); 890258#L26 call #t~ret0 := fact(~n - 1);< 890311#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890105#factFINAL assume true; 890014#factEXIT >#74#return; 889832#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890010#factENTRY ~n := #in~n; 891273#L25 assume !(~n <= 0); 890095#L26 call #t~ret0 := fact(~n - 1);< 890270#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890011#factFINAL assume true; 889711#factEXIT >#76#return; 889887#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890010#factENTRY ~n := #in~n; 891273#L25 assume !(~n <= 0); 890095#L26 call #t~ret0 := fact(~n - 1);< 890270#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890011#factFINAL assume true; 889711#factEXIT >#78#return; 887917#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; 887918#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 893734#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 893733#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 893732#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; 891789#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 891790#factENTRY ~n := #in~n; 892583#L25 assume !(~n <= 0); 892011#L26 call #t~ret0 := fact(~n - 1);< 892026#factENTRY ~n := #in~n; 893648#L25 assume !(~n <= 0); 892013#L26 call #t~ret0 := fact(~n - 1);< 892588#factENTRY ~n := #in~n; 893648#L25 assume !(~n <= 0); 892013#L26 call #t~ret0 := fact(~n - 1);< 892588#factENTRY ~n := #in~n; 892631#L25 assume ~n <= 0;#res := 1; 892630#factFINAL assume true; 892585#factEXIT >#66#return; 892584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892076#factFINAL assume true; 892057#factEXIT >#66#return; 892056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892053#factFINAL assume true; 892008#factEXIT >#66#return; 892006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891793#factFINAL assume true; 891785#factEXIT >#74#return; 891772#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 891774#factENTRY ~n := #in~n; 894521#L25 assume !(~n <= 0); 894491#L26 call #t~ret0 := fact(~n - 1);< 894520#factENTRY ~n := #in~n; 894681#L25 assume ~n <= 0;#res := 1; 894678#factFINAL assume true; 894671#factEXIT >#66#return; 894672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894891#factFINAL assume true; 894890#factEXIT >#76#return; 893913#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 893914#factENTRY ~n := #in~n; 894584#L25 assume !(~n <= 0); 894500#L26 call #t~ret0 := fact(~n - 1);< 894529#factENTRY ~n := #in~n; 894609#L25 assume !(~n <= 0); 894605#L26 call #t~ret0 := fact(~n - 1);< 894607#factENTRY ~n := #in~n; 894612#L25 assume ~n <= 0;#res := 1; 894611#factFINAL assume true; 894604#factEXIT >#66#return; 894603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894522#factFINAL assume true; 894486#factEXIT >#66#return; 894516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894583#factFINAL assume true; 894456#factEXIT >#78#return; 893827#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; 893825#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 893824#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 893823#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 893821#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; 887912#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 887905#factENTRY ~n := #in~n; 887914#L25 assume !(~n <= 0); 887873#L26 call #t~ret0 := fact(~n - 1);< 895342#factENTRY ~n := #in~n; 895344#L25 assume !(~n <= 0); 887874#L26 call #t~ret0 := fact(~n - 1);< 895343#factENTRY ~n := #in~n; 895344#L25 assume !(~n <= 0); 887874#L26 call #t~ret0 := fact(~n - 1);< 895343#factENTRY ~n := #in~n; 895344#L25 assume !(~n <= 0); 887874#L26 call #t~ret0 := fact(~n - 1);< 895343#factENTRY ~n := #in~n; 895344#L25 assume !(~n <= 0); 887874#L26 call #t~ret0 := fact(~n - 1);< 895343#factENTRY ~n := #in~n; 895344#L25 assume !(~n <= 0); 887874#L26 call #t~ret0 := fact(~n - 1);< 895343#factENTRY ~n := #in~n; 895344#L25 assume !(~n <= 0); 887874#L26 call #t~ret0 := fact(~n - 1);< 895343#factENTRY ~n := #in~n; 895344#L25 assume !(~n <= 0); 887874#L26 call #t~ret0 := fact(~n - 1);< 895343#factENTRY ~n := #in~n; 895345#L25 assume ~n <= 0;#res := 1; 895363#factFINAL assume true; 895362#factEXIT >#66#return; 887947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887888#factFINAL assume true; 887872#factEXIT >#66#return; 887875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895361#factFINAL assume true; 895360#factEXIT >#66#return; 895359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895358#factFINAL assume true; 895357#factEXIT >#66#return; 895356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895355#factFINAL assume true; 895354#factEXIT >#66#return; 895353#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895352#factFINAL assume true; 895351#factEXIT >#66#return; 895350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895349#factFINAL assume true; 895348#factEXIT >#66#return; 895347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895346#factFINAL assume true; 895341#factEXIT >#66#return; 895340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895339#factFINAL assume true; 891626#factEXIT >#74#return; 891394#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 891396#factENTRY ~n := #in~n; 891624#L25 assume !(~n <= 0); 891285#L26 call #t~ret0 := fact(~n - 1);< 891334#factENTRY ~n := #in~n; 893104#L25 assume ~n <= 0;#res := 1; 891488#factFINAL assume true; 891330#factEXIT >#66#return; 891332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891619#factFINAL assume true; 891393#factEXIT >#76#return; 890543#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 891317#factENTRY ~n := #in~n; 891669#L25 assume !(~n <= 0); 891537#L26 call #t~ret0 := fact(~n - 1);< 891541#factENTRY ~n := #in~n; 892956#L25 assume !(~n <= 0); 891417#L26 call #t~ret0 := fact(~n - 1);< 892955#factENTRY ~n := #in~n; 892957#L25 assume !(~n <= 0); 891414#L26 call #t~ret0 := fact(~n - 1);< 892207#factENTRY ~n := #in~n; 895268#L25 assume !(~n <= 0); 891415#L26 call #t~ret0 := fact(~n - 1);< 891595#factENTRY ~n := #in~n; 895267#L25 assume !(~n <= 0); 891289#L26 call #t~ret0 := fact(~n - 1);< 891667#factENTRY ~n := #in~n; 892030#L25 assume !(~n <= 0); 891299#L26 call #t~ret0 := fact(~n - 1);< 892028#factENTRY ~n := #in~n; 891730#L25 assume ~n <= 0;#res := 1; 891729#factFINAL assume true; 891719#factEXIT >#66#return; 891561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891368#factFINAL assume true; 891276#factEXIT >#66#return; 891305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891601#factFINAL assume true; 891580#factEXIT >#66#return; 891588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892206#factFINAL assume true; 891831#factEXIT >#66#return; 891833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892954#factFINAL assume true; 891403#factEXIT >#66#return; 891421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894134#factFINAL assume true; 894128#factEXIT >#66#return; 894130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894315#factFINAL assume true; 891165#factEXIT >#78#return; 890520#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; 890507#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 890506#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 890504#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 890496#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 890494#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 890492#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 890491#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; 890489#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890490#factENTRY ~n := #in~n; 890505#L25 assume !(~n <= 0); 890499#L26 call #t~ret0 := fact(~n - 1);< 890503#factENTRY ~n := #in~n; 888152#L25 assume !(~n <= 0); 890498#L26 call #t~ret0 := fact(~n - 1);< 890595#factENTRY ~n := #in~n; 890683#L25 assume ~n <= 0;#res := 1; 890623#factFINAL assume true; 890594#factEXIT >#66#return; 890522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890515#factFINAL assume true; 890497#factEXIT >#66#return; 890495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890493#factFINAL assume true; 890488#factEXIT >#68#return; 888033#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 888121#factENTRY ~n := #in~n; 888132#L25 assume ~n <= 0;#res := 1; 888123#factFINAL assume true; 887993#factEXIT >#70#return; 888097#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890447#factENTRY ~n := #in~n; 890487#L25 assume !(~n <= 0); 890250#L26 call #t~ret0 := fact(~n - 1);< 890485#factENTRY ~n := #in~n; 890792#L25 assume !(~n <= 0); 890248#L26 call #t~ret0 := fact(~n - 1);< 890309#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890481#factFINAL assume true; 890446#factEXIT >#72#return; 890444#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; 890442#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 890440#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 890437#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 890419#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; 890016#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890106#factENTRY ~n := #in~n; 891249#L25 assume !(~n <= 0); 890230#L26 call #t~ret0 := fact(~n - 1);< 890273#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890105#factFINAL assume true; 890014#factEXIT >#68#return; 889907#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890366#factENTRY ~n := #in~n; 890620#L25 assume !(~n <= 0); 890091#L26 call #t~ret0 := fact(~n - 1);< 890104#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890011#factFINAL assume true; 889711#factEXIT >#70#return; 889960#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890399#factENTRY ~n := #in~n; 890435#L25 assume !(~n <= 0); 890089#L26 call #t~ret0 := fact(~n - 1);< 890270#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890400#factFINAL assume true; 890384#factEXIT >#72#return; 890383#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; 890381#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 890379#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 890378#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 890375#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; 890017#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890106#factENTRY ~n := #in~n; 891249#L25 assume !(~n <= 0); 890230#L26 call #t~ret0 := fact(~n - 1);< 890273#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890105#factFINAL assume true; 890014#factEXIT >#68#return; 889923#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890366#factENTRY ~n := #in~n; 890620#L25 assume !(~n <= 0); 890091#L26 call #t~ret0 := fact(~n - 1);< 890104#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890105#factFINAL assume true; 890014#factEXIT >#70#return; 890081#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890352#factENTRY ~n := #in~n; 890367#L25 assume ~n <= 0;#res := 1; 890365#factFINAL assume true; 890317#factEXIT >#72#return; 890314#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; 890312#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 890306#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 890280#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 890268#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; 890180#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890226#factENTRY ~n := #in~n; 890374#L25 assume !(~n <= 0); 890232#L26 call #t~ret0 := fact(~n - 1);< 890316#factENTRY ~n := #in~n; 890313#L25 assume !(~n <= 0); 890258#L26 call #t~ret0 := fact(~n - 1);< 890311#factENTRY ~n := #in~n; 890313#L25 assume !(~n <= 0); 890258#L26 call #t~ret0 := fact(~n - 1);< 890311#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890265#factFINAL assume true; 890112#factEXIT >#74#return; 890018#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890107#factENTRY ~n := #in~n; 891258#L25 assume !(~n <= 0); 890087#L26 call #t~ret0 := fact(~n - 1);< 890104#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890105#factFINAL assume true; 890014#factEXIT >#76#return; 889937#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890012#factENTRY ~n := #in~n; 891490#L25 assume !(~n <= 0); 890090#L26 call #t~ret0 := fact(~n - 1);< 890104#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890011#factFINAL assume true; 889711#factEXIT >#78#return; 889996#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; 891599#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 891600#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 895238#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 893124#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; 891786#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 891790#factENTRY ~n := #in~n; 892583#L25 assume !(~n <= 0); 892011#L26 call #t~ret0 := fact(~n - 1);< 892026#factENTRY ~n := #in~n; 893648#L25 assume !(~n <= 0); 892013#L26 call #t~ret0 := fact(~n - 1);< 892588#factENTRY ~n := #in~n; 893648#L25 assume !(~n <= 0); 892013#L26 call #t~ret0 := fact(~n - 1);< 892588#factENTRY ~n := #in~n; 892631#L25 assume ~n <= 0;#res := 1; 892630#factFINAL assume true; 892585#factEXIT >#66#return; 892584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892076#factFINAL assume true; 892057#factEXIT >#66#return; 892056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892053#factFINAL assume true; 892008#factEXIT >#66#return; 892006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891793#factFINAL assume true; 891785#factEXIT >#74#return; 891773#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 891778#factENTRY ~n := #in~n; 891983#L25 assume !(~n <= 0); 891951#L26 call #t~ret0 := fact(~n - 1);< 891970#factENTRY ~n := #in~n; 892500#L25 assume !(~n <= 0); 891977#L26 call #t~ret0 := fact(~n - 1);< 891979#factENTRY ~n := #in~n; 891982#L25 assume ~n <= 0;#res := 1; 891981#factFINAL assume true; 891976#factEXIT >#66#return; 891975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891972#factFINAL assume true; 891930#factEXIT >#66#return; 891966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891980#factFINAL assume true; 891771#factEXIT >#76#return; 891759#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 891760#factENTRY ~n := #in~n; 893050#L25 assume !(~n <= 0); 891953#L26 call #t~ret0 := fact(~n - 1);< 891973#factENTRY ~n := #in~n; 892500#L25 assume !(~n <= 0); 891977#L26 call #t~ret0 := fact(~n - 1);< 891979#factENTRY ~n := #in~n; 891982#L25 assume ~n <= 0;#res := 1; 891981#factFINAL assume true; 891976#factEXIT >#66#return; 891975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891972#factFINAL assume true; 891930#factEXIT >#66#return; 891967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892485#factFINAL assume true; 891921#factEXIT >#78#return; 891743#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; 891742#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 891741#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 891740#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 891737#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; 891353#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 887869#factENTRY ~n := #in~n; 892845#L25 assume !(~n <= 0); 891279#L26 call #t~ret0 := fact(~n - 1);< 891555#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891730#L25 assume ~n <= 0;#res := 1; 891729#factFINAL assume true; 891719#factEXIT >#66#return; 891561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891368#factFINAL assume true; 891276#factEXIT >#66#return; 891305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891601#factFINAL assume true; 891580#factEXIT >#66#return; 891588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892206#factFINAL assume true; 891831#factEXIT >#66#return; 891833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892954#factFINAL assume true; 891403#factEXIT >#66#return; 891421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894134#factFINAL assume true; 894128#factEXIT >#66#return; 894129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895333#factFINAL assume true; 891532#factEXIT >#66#return; 891539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892033#factFINAL assume true; 891797#factEXIT >#66#return; 891795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891692#factFINAL assume true; 891685#factEXIT >#66#return; 891684#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891683#factFINAL assume true; 891681#factEXIT >#66#return; 891682#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892886#factFINAL assume true; 891398#factEXIT >#74#return; 891234#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 891264#factENTRY ~n := #in~n; 891497#L25 assume !(~n <= 0); 891288#L26 call #t~ret0 := fact(~n - 1);< 891334#factENTRY ~n := #in~n; 891984#L25 assume !(~n <= 0); 891720#L26 call #t~ret0 := fact(~n - 1);< 891722#factENTRY ~n := #in~n; 891730#L25 assume ~n <= 0;#res := 1; 891729#factFINAL assume true; 891719#factEXIT >#66#return; 891561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891368#factFINAL assume true; 891276#factEXIT >#66#return; 891306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891263#factFINAL assume true; 891233#factEXIT >#76#return; 891202#L30-7 [2022-11-18 20:36:19,797 INFO L750 eck$LassoCheckResult]: Loop: 891202#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 891182#factENTRY ~n := #in~n; 892579#L25 assume !(~n <= 0); 891535#L26 call #t~ret0 := fact(~n - 1);< 892034#factENTRY ~n := #in~n; 892613#L25 assume !(~n <= 0); 891534#L26 call #t~ret0 := fact(~n - 1);< 891541#factENTRY ~n := #in~n; 892956#L25 assume !(~n <= 0); 891417#L26 call #t~ret0 := fact(~n - 1);< 892955#factENTRY ~n := #in~n; 892957#L25 assume !(~n <= 0); 891414#L26 call #t~ret0 := fact(~n - 1);< 892207#factENTRY ~n := #in~n; 895268#L25 assume !(~n <= 0); 891415#L26 call #t~ret0 := fact(~n - 1);< 891595#factENTRY ~n := #in~n; 895267#L25 assume !(~n <= 0); 891289#L26 call #t~ret0 := fact(~n - 1);< 891667#factENTRY ~n := #in~n; 892030#L25 assume !(~n <= 0); 891299#L26 call #t~ret0 := fact(~n - 1);< 892028#factENTRY ~n := #in~n; 892007#L25 assume !(~n <= 0); 891296#L26 call #t~ret0 := fact(~n - 1);< 891724#factENTRY ~n := #in~n; 891730#L25 assume ~n <= 0;#res := 1; 891729#factFINAL assume true; 891719#factEXIT >#66#return; 891561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891368#factFINAL assume true; 891276#factEXIT >#66#return; 891305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891601#factFINAL assume true; 891580#factEXIT >#66#return; 891588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892206#factFINAL assume true; 891831#factEXIT >#66#return; 891833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892954#factFINAL assume true; 891403#factEXIT >#66#return; 891421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894134#factFINAL assume true; 894128#factEXIT >#66#return; 894129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895333#factFINAL assume true; 891532#factEXIT >#66#return; 891539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892033#factFINAL assume true; 891797#factEXIT >#66#return; 891800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 893627#factFINAL assume true; 891196#factEXIT >#78#return; 891164#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; 895106#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 895105#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 895104#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 895103#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 895101#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 895100#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 895098#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; 890655#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890664#factENTRY ~n := #in~n; 890663#L25 assume !(~n <= 0); 890501#L26 call #t~ret0 := fact(~n - 1);< 890503#factENTRY ~n := #in~n; 888152#L25 assume !(~n <= 0); 890498#L26 call #t~ret0 := fact(~n - 1);< 890595#factENTRY ~n := #in~n; 888152#L25 assume !(~n <= 0); 890498#L26 call #t~ret0 := fact(~n - 1);< 890595#factENTRY ~n := #in~n; 888152#L25 assume !(~n <= 0); 890498#L26 call #t~ret0 := fact(~n - 1);< 890595#factENTRY ~n := #in~n; 890683#L25 assume ~n <= 0;#res := 1; 890623#factFINAL assume true; 890594#factEXIT >#66#return; 890522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890515#factFINAL assume true; 890497#factEXIT >#66#return; 890502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891019#factFINAL assume true; 891015#factEXIT >#66#return; 891013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891012#factFINAL assume true; 891009#factEXIT >#66#return; 891010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891103#factFINAL assume true; 891096#factEXIT >#68#return; 888041#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 888121#factENTRY ~n := #in~n; 888132#L25 assume ~n <= 0;#res := 1; 888123#factFINAL assume true; 887993#factEXIT >#70#return; 888104#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 891083#factENTRY ~n := #in~n; 891081#L25 assume !(~n <= 0); 890299#L26 call #t~ret0 := fact(~n - 1);< 890805#factENTRY ~n := #in~n; 890801#L25 assume !(~n <= 0); 890256#L26 call #t~ret0 := fact(~n - 1);< 890795#factENTRY ~n := #in~n; 890793#L25 assume !(~n <= 0); 890254#L26 call #t~ret0 := fact(~n - 1);< 890309#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891107#factFINAL assume true; 891087#factEXIT >#72#return; 891090#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; 895094#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 895092#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 895091#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 895090#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; 890136#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890712#factENTRY ~n := #in~n; 890950#L25 assume !(~n <= 0); 890293#L26 call #t~ret0 := fact(~n - 1);< 890855#factENTRY ~n := #in~n; 891112#L25 assume !(~n <= 0); 890244#L26 call #t~ret0 := fact(~n - 1);< 890439#factENTRY ~n := #in~n; 890877#L25 assume !(~n <= 0); 890246#L26 call #t~ret0 := fact(~n - 1);< 890803#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890265#factFINAL assume true; 890112#factEXIT >#68#return; 889745#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 887959#factENTRY ~n := #in~n; 890368#L25 assume !(~n <= 0); 890096#L26 call #t~ret0 := fact(~n - 1);< 890315#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890011#factFINAL assume true; 889711#factEXIT >#70#return; 889938#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890789#factENTRY ~n := #in~n; 890708#L25 assume !(~n <= 0); 890231#L26 call #t~ret0 := fact(~n - 1);< 890273#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890983#factFINAL assume true; 890915#factEXIT >#72#return; 890918#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; 895089#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 895088#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 895087#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 895086#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; 890141#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890266#factENTRY ~n := #in~n; 891564#L25 assume !(~n <= 0); 890292#L26 call #t~ret0 := fact(~n - 1);< 891115#factENTRY ~n := #in~n; 891116#L25 assume !(~n <= 0); 890261#L26 call #t~ret0 := fact(~n - 1);< 890309#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890265#factFINAL assume true; 890112#factEXIT >#68#return; 889776#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890611#factENTRY ~n := #in~n; 890610#L25 assume !(~n <= 0); 890100#L26 call #t~ret0 := fact(~n - 1);< 890305#factENTRY ~n := #in~n; 890793#L25 assume !(~n <= 0); 890254#L26 call #t~ret0 := fact(~n - 1);< 890309#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890105#factFINAL assume true; 890014#factEXIT >#70#return; 890072#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890707#factENTRY ~n := #in~n; 890706#L25 assume !(~n <= 0); 890093#L26 call #t~ret0 := fact(~n - 1);< 890104#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890400#factFINAL assume true; 890384#factEXIT >#72#return; 890393#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; 895085#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 895084#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 895083#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 895082#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; 890146#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890266#factENTRY ~n := #in~n; 891564#L25 assume !(~n <= 0); 890292#L26 call #t~ret0 := fact(~n - 1);< 891115#factENTRY ~n := #in~n; 891116#L25 assume !(~n <= 0); 890261#L26 call #t~ret0 := fact(~n - 1);< 890309#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890265#factFINAL assume true; 890112#factEXIT >#68#return; 889824#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890611#factENTRY ~n := #in~n; 890610#L25 assume !(~n <= 0); 890100#L26 call #t~ret0 := fact(~n - 1);< 890305#factENTRY ~n := #in~n; 890793#L25 assume !(~n <= 0); 890254#L26 call #t~ret0 := fact(~n - 1);< 890309#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890265#factFINAL assume true; 890112#factEXIT >#70#return; 890181#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890352#factENTRY ~n := #in~n; 890367#L25 assume ~n <= 0;#res := 1; 890365#factFINAL assume true; 890317#factEXIT >#72#return; 890343#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; 895081#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 895080#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 895079#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 895078#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; 890356#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 890376#factENTRY ~n := #in~n; 890371#L25 assume !(~n <= 0); 890249#L26 call #t~ret0 := fact(~n - 1);< 890316#factENTRY ~n := #in~n; 890313#L25 assume !(~n <= 0); 890258#L26 call #t~ret0 := fact(~n - 1);< 890311#factENTRY ~n := #in~n; 890313#L25 assume !(~n <= 0); 890258#L26 call #t~ret0 := fact(~n - 1);< 890311#factENTRY ~n := #in~n; 890313#L25 assume !(~n <= 0); 890258#L26 call #t~ret0 := fact(~n - 1);< 890311#factENTRY ~n := #in~n; 890313#L25 assume !(~n <= 0); 890258#L26 call #t~ret0 := fact(~n - 1);< 890311#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890860#factFINAL assume true; 890846#factEXIT >#66#return; 890853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891029#factFINAL assume true; 891024#factEXIT >#66#return; 891025#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891106#factFINAL assume true; 890421#factEXIT >#74#return; 890153#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 890267#factENTRY ~n := #in~n; 895319#L25 assume !(~n <= 0); 890296#L26 call #t~ret0 := fact(~n - 1);< 890304#factENTRY ~n := #in~n; 891111#L25 assume !(~n <= 0); 890259#L26 call #t~ret0 := fact(~n - 1);< 890273#factENTRY ~n := #in~n; 891271#L25 assume !(~n <= 0); 890308#L26 call #t~ret0 := fact(~n - 1);< 890310#factENTRY ~n := #in~n; 890743#L25 assume ~n <= 0;#res := 1; 890705#factFINAL assume true; 890307#factEXIT >#66#return; 890281#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890272#factFINAL assume true; 890229#factEXIT >#66#return; 890263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890407#factFINAL assume true; 890285#factEXIT >#66#return; 890279#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890265#factFINAL assume true; 890112#factEXIT >#76#return; 889826#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 890012#factENTRY ~n := #in~n; 891490#L25 assume !(~n <= 0); 890090#L26 call #t~ret0 := fact(~n - 1);< 890104#factENTRY ~n := #in~n; 890228#L25 assume ~n <= 0;#res := 1; 890109#factFINAL assume true; 890083#factEXIT >#66#return; 890013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 890011#factFINAL assume true; 889711#factEXIT >#78#return; 889939#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; 895075#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 895073#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 895071#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 894833#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; 891454#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 891784#factENTRY ~n := #in~n; 893643#L25 assume !(~n <= 0); 892533#L26 call #t~ret0 := fact(~n - 1);< 893070#factENTRY ~n := #in~n; 893485#L25 assume !(~n <= 0); 892506#L26 call #t~ret0 := fact(~n - 1);< 893304#factENTRY ~n := #in~n; 893485#L25 assume !(~n <= 0); 892506#L26 call #t~ret0 := fact(~n - 1);< 893304#factENTRY ~n := #in~n; 893485#L25 assume !(~n <= 0); 892506#L26 call #t~ret0 := fact(~n - 1);< 893304#factENTRY ~n := #in~n; 893485#L25 assume !(~n <= 0); 892506#L26 call #t~ret0 := fact(~n - 1);< 893304#factENTRY ~n := #in~n; 893294#L25 assume ~n <= 0;#res := 1; 893394#factFINAL assume true; 893300#factEXIT >#66#return; 893298#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 893295#factFINAL assume true; 893024#factEXIT >#66#return; 893036#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 893151#factFINAL assume true; 893136#factEXIT >#66#return; 893135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 893125#factFINAL assume true; 892502#factEXIT >#66#return; 892539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 893120#factFINAL assume true; 893105#factEXIT >#66#return; 892499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892001#factFINAL assume true; 891780#factEXIT >#74#return; 891782#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 893812#factENTRY ~n := #in~n; 895111#L25 assume !(~n <= 0); 892465#L26 call #t~ret0 := fact(~n - 1);< 892480#factENTRY ~n := #in~n; 892889#L25 assume !(~n <= 0); 891945#L26 call #t~ret0 := fact(~n - 1);< 891973#factENTRY ~n := #in~n; 892500#L25 assume !(~n <= 0); 891977#L26 call #t~ret0 := fact(~n - 1);< 891979#factENTRY ~n := #in~n; 891982#L25 assume ~n <= 0;#res := 1; 891981#factFINAL assume true; 891976#factEXIT >#66#return; 891975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891972#factFINAL assume true; 891930#factEXIT >#66#return; 891960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892878#factFINAL assume true; 892464#factEXIT >#66#return; 892471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895110#factFINAL assume true; 895109#factEXIT >#76#return; 891925#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 891909#factENTRY ~n := #in~n; 892930#L25 assume !(~n <= 0); 891958#L26 call #t~ret0 := fact(~n - 1);< 891973#factENTRY ~n := #in~n; 892500#L25 assume !(~n <= 0); 891977#L26 call #t~ret0 := fact(~n - 1);< 891979#factENTRY ~n := #in~n; 891982#L25 assume ~n <= 0;#res := 1; 891981#factFINAL assume true; 891976#factEXIT >#66#return; 891975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891972#factFINAL assume true; 891930#factEXIT >#66#return; 891964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892496#factFINAL assume true; 891923#factEXIT >#78#return; 891751#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; 894903#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 894783#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 894467#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 894311#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; 887868#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 887869#factENTRY ~n := #in~n; 892845#L25 assume !(~n <= 0); 891279#L26 call #t~ret0 := fact(~n - 1);< 891555#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891731#L25 assume !(~n <= 0); 891278#L26 call #t~ret0 := fact(~n - 1);< 891721#factENTRY ~n := #in~n; 891730#L25 assume ~n <= 0;#res := 1; 891729#factFINAL assume true; 891719#factEXIT >#66#return; 891561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891368#factFINAL assume true; 891276#factEXIT >#66#return; 891305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891601#factFINAL assume true; 891580#factEXIT >#66#return; 891588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892206#factFINAL assume true; 891831#factEXIT >#66#return; 891833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892954#factFINAL assume true; 891403#factEXIT >#66#return; 891421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 894134#factFINAL assume true; 894128#factEXIT >#66#return; 894129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 895333#factFINAL assume true; 891532#factEXIT >#66#return; 891539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892033#factFINAL assume true; 891797#factEXIT >#66#return; 891795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891692#factFINAL assume true; 891685#factEXIT >#66#return; 891684#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891683#factFINAL assume true; 891681#factEXIT >#66#return; 891680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891679#factFINAL assume true; 891675#factEXIT >#66#return; 891676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892049#factFINAL assume true; 891803#factEXIT >#74#return; 891252#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 892294#factENTRY ~n := #in~n; 892295#L25 assume !(~n <= 0); 891581#L26 call #t~ret0 := fact(~n - 1);< 891727#factENTRY ~n := #in~n; 891726#L25 assume !(~n <= 0); 891277#L26 call #t~ret0 := fact(~n - 1);< 891314#factENTRY ~n := #in~n; 891984#L25 assume !(~n <= 0); 891720#L26 call #t~ret0 := fact(~n - 1);< 891722#factENTRY ~n := #in~n; 891730#L25 assume ~n <= 0;#res := 1; 891729#factFINAL assume true; 891719#factEXIT >#66#return; 891561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891368#factFINAL assume true; 891276#factEXIT >#66#return; 891305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 891601#factFINAL assume true; 891580#factEXIT >#66#return; 891589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 892293#factFINAL assume true; 891250#factEXIT >#76#return; 891202#L30-7 [2022-11-18 20:36:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -393657004, now seen corresponding path program 59 times [2022-11-18 20:36:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:19,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607969225] [2022-11-18 20:36:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:19,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:19,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43152155] [2022-11-18 20:36:19,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:36:19,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:19,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:19,929 INFO L229 MonitoredProcess]: Starting monitored process 329 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:19,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (329)] Waiting until timeout for monitored process [2022-11-18 20:36:22,392 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-18 20:36:22,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:22,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:36:22,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 46657 backedges. 16804 proven. 230 refuted. 0 times theorem prover too weak. 29623 trivial. 0 not checked. [2022-11-18 20:36:22,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 46657 backedges. 908 proven. 3846 refuted. 0 times theorem prover too weak. 41903 trivial. 0 not checked. [2022-11-18 20:36:25,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:25,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607969225] [2022-11-18 20:36:25,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:25,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43152155] [2022-11-18 20:36:25,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43152155] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:25,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:25,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 29 [2022-11-18 20:36:25,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562450146] [2022-11-18 20:36:25,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:25,286 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:36:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1831509647, now seen corresponding path program 43 times [2022-11-18 20:36:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:25,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115747225] [2022-11-18 20:36:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:25,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:25,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851848599] [2022-11-18 20:36:25,327 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:36:25,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:25,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:25,333 INFO L229 MonitoredProcess]: Starting monitored process 330 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:25,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (330)] Waiting until timeout for monitored process [2022-11-18 20:36:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:27,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:36:27,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19369 backedges. 7116 proven. 106 refuted. 0 times theorem prover too weak. 12147 trivial. 0 not checked. [2022-11-18 20:36:27,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 19369 backedges. 418 proven. 2470 refuted. 0 times theorem prover too weak. 16481 trivial. 0 not checked. [2022-11-18 20:36:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:29,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115747225] [2022-11-18 20:36:29,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:29,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851848599] [2022-11-18 20:36:29,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851848599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:29,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:29,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 24 [2022-11-18 20:36:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048851681] [2022-11-18 20:36:29,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:29,548 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:36:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:29,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 20:36:29,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-11-18 20:36:29,548 INFO L87 Difference]: Start difference. First operand 7524 states and 15948 transitions. cyclomatic complexity: 8490 Second operand has 24 states, 21 states have (on average 3.0) internal successors, (63), 22 states have internal predecessors, (63), 14 states have call successors, (29), 2 states have call predecessors, (29), 10 states have return successors, (34), 11 states have call predecessors, (34), 14 states have call successors, (34) [2022-11-18 20:36:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:30,877 INFO L93 Difference]: Finished difference Result 8019 states and 16507 transitions. [2022-11-18 20:36:30,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8019 states and 16507 transitions. [2022-11-18 20:36:30,952 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1571 [2022-11-18 20:36:31,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8019 states to 8018 states and 16505 transitions. [2022-11-18 20:36:31,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2802 [2022-11-18 20:36:31,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2802 [2022-11-18 20:36:31,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8018 states and 16505 transitions. [2022-11-18 20:36:31,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:36:31,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8018 states and 16505 transitions. [2022-11-18 20:36:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8018 states and 16505 transitions. [2022-11-18 20:36:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8018 to 7503. [2022-11-18 20:36:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7503 states, 4301 states have (on average 1.038828179493141) internal successors, (4468), 4282 states have internal predecessors, (4468), 2426 states have call successors, (2527), 993 states have call predecessors, (2527), 776 states have return successors, (8859), 2227 states have call predecessors, (8859), 2426 states have call successors, (8859) [2022-11-18 20:36:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7503 states to 7503 states and 15854 transitions. [2022-11-18 20:36:31,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7503 states and 15854 transitions. [2022-11-18 20:36:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:36:31,288 INFO L428 stractBuchiCegarLoop]: Abstraction has 7503 states and 15854 transitions. [2022-11-18 20:36:31,288 INFO L335 stractBuchiCegarLoop]: ======== Iteration 76 ============ [2022-11-18 20:36:31,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7503 states and 15854 transitions. [2022-11-18 20:36:31,324 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1300 [2022-11-18 20:36:31,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:36:31,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:36:31,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [134, 134, 87, 87, 87, 87, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:36:31,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [87, 87, 66, 66, 66, 66, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:36:31,330 INFO L748 eck$LassoCheckResult]: Stem: 912012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 911971#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; 911972#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 912011#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; 912039#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 912049#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 912047#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; 912045#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 912046#factENTRY ~n := #in~n; 912054#L25 assume ~n <= 0;#res := 1; 912052#factFINAL assume true; 912044#factEXIT >#68#return; 912033#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912034#factENTRY ~n := #in~n; 912050#L25 assume ~n <= 0;#res := 1; 912048#factFINAL assume true; 912043#factEXIT >#70#return; 911947#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 911948#factENTRY ~n := #in~n; 912180#L25 assume ~n <= 0;#res := 1; 912062#factFINAL assume true; 912058#factEXIT >#72#return; 912006#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; 912007#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 912009#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 912740#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 912739#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; 912737#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 912738#factENTRY ~n := #in~n; 912747#L25 assume !(~n <= 0); 912744#L26 call #t~ret0 := fact(~n - 1);< 912745#factENTRY ~n := #in~n; 912754#L25 assume ~n <= 0;#res := 1; 912752#factFINAL assume true; 912743#factEXIT >#66#return; 912742#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912741#factFINAL assume true; 912736#factEXIT >#74#return; 912734#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912735#factENTRY ~n := #in~n; 912753#L25 assume ~n <= 0;#res := 1; 912750#factFINAL assume true; 912733#factEXIT >#76#return; 912718#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 912719#factENTRY ~n := #in~n; 912751#L25 assume !(~n <= 0); 912731#L26 call #t~ret0 := fact(~n - 1);< 912732#factENTRY ~n := #in~n; 912749#L25 assume ~n <= 0;#res := 1; 912748#factFINAL assume true; 912730#factEXIT >#66#return; 912728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912726#factFINAL assume true; 912717#factEXIT >#78#return; 912715#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; 912714#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 912709#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 912705#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 912699#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; 912683#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 912684#factENTRY ~n := #in~n; 912698#L25 assume !(~n <= 0); 912695#L26 call #t~ret0 := fact(~n - 1);< 912697#factENTRY ~n := #in~n; 912722#L25 assume !(~n <= 0); 912696#L26 call #t~ret0 := fact(~n - 1);< 912713#factENTRY ~n := #in~n; 912720#L25 assume ~n <= 0;#res := 1; 912716#factFINAL assume true; 912712#factEXIT >#66#return; 912708#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912704#factFINAL assume true; 912694#factEXIT >#66#return; 912693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912692#factFINAL assume true; 912682#factEXIT >#74#return; 912678#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912679#factENTRY ~n := #in~n; 912691#L25 assume ~n <= 0;#res := 1; 912681#factFINAL assume true; 912677#factEXIT >#76#return; 912674#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 912675#factENTRY ~n := #in~n; 912707#L25 assume !(~n <= 0); 912686#L26 call #t~ret0 := fact(~n - 1);< 912690#factENTRY ~n := #in~n; 912724#L25 assume !(~n <= 0); 912688#L26 call #t~ret0 := fact(~n - 1);< 912711#factENTRY ~n := #in~n; 912723#L25 assume ~n <= 0;#res := 1; 912721#factFINAL assume true; 912710#factEXIT >#66#return; 912706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912700#factFINAL assume true; 912685#factEXIT >#66#return; 912680#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912676#factFINAL assume true; 912673#factEXIT >#78#return; 912672#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; 912671#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 912670#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 912669#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 912668#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; 912635#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 912746#factENTRY ~n := #in~n; 912665#L25 assume !(~n <= 0); 912666#L26 call #t~ret0 := fact(~n - 1);< 912690#factENTRY ~n := #in~n; 912724#L25 assume !(~n <= 0); 912688#L26 call #t~ret0 := fact(~n - 1);< 912711#factENTRY ~n := #in~n; 912724#L25 assume !(~n <= 0); 912688#L26 call #t~ret0 := fact(~n - 1);< 912711#factENTRY ~n := #in~n; 912723#L25 assume ~n <= 0;#res := 1; 912721#factFINAL assume true; 912710#factEXIT >#66#return; 912706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912700#factFINAL assume true; 912685#factEXIT >#66#return; 912689#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912759#factFINAL assume true; 912755#factEXIT >#66#return; 912648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912649#factFINAL assume true; 912634#factEXIT >#74#return; 912621#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912629#factENTRY ~n := #in~n; 913576#L25 assume ~n <= 0;#res := 1; 913568#factFINAL assume true; 913061#factEXIT >#76#return; 913062#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 913183#factENTRY ~n := #in~n; 913180#L25 assume !(~n <= 0); 913096#L26 call #t~ret0 := fact(~n - 1);< 913130#factENTRY ~n := #in~n; 913147#L25 assume !(~n <= 0); 913099#L26 call #t~ret0 := fact(~n - 1);< 913105#factENTRY ~n := #in~n; 913143#L25 assume !(~n <= 0); 913094#L26 call #t~ret0 := fact(~n - 1);< 913141#factENTRY ~n := #in~n; 913144#L25 assume ~n <= 0;#res := 1; 913142#factFINAL assume true; 913140#factEXIT >#66#return; 913138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 913137#factFINAL assume true; 913135#factEXIT >#66#return; 913133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 913131#factFINAL assume true; 913128#factEXIT >#66#return; 913103#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 913195#factFINAL assume true; 913166#factEXIT >#78#return; 912584#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; 912563#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 912558#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 912553#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 912471#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; 912468#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 912469#factENTRY ~n := #in~n; 912516#L25 assume !(~n <= 0); 912490#L26 call #t~ret0 := fact(~n - 1);< 912492#factENTRY ~n := #in~n; 912508#L25 assume !(~n <= 0); 912491#L26 call #t~ret0 := fact(~n - 1);< 912506#factENTRY ~n := #in~n; 912508#L25 assume !(~n <= 0); 912491#L26 call #t~ret0 := fact(~n - 1);< 912506#factENTRY ~n := #in~n; 912508#L25 assume !(~n <= 0); 912491#L26 call #t~ret0 := fact(~n - 1);< 912506#factENTRY ~n := #in~n; 912508#L25 assume !(~n <= 0); 912491#L26 call #t~ret0 := fact(~n - 1);< 912506#factENTRY ~n := #in~n; 912508#L25 assume !(~n <= 0); 912491#L26 call #t~ret0 := fact(~n - 1);< 912506#factENTRY ~n := #in~n; 912535#L25 assume ~n <= 0;#res := 1; 912534#factFINAL assume true; 912532#factEXIT >#66#return; 912531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912530#factFINAL assume true; 912528#factEXIT >#66#return; 912527#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912526#factFINAL assume true; 912524#factEXIT >#66#return; 912522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912520#factFINAL assume true; 912518#factEXIT >#66#return; 912515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912514#factFINAL assume true; 912505#factEXIT >#66#return; 912499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912496#factFINAL assume true; 912489#factEXIT >#66#return; 912488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912485#factFINAL assume true; 912467#factEXIT >#74#return; 912463#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912465#factENTRY ~n := #in~n; 912494#L25 assume ~n <= 0;#res := 1; 912481#factFINAL assume true; 912462#factEXIT >#76#return; 912354#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 912448#factENTRY ~n := #in~n; 912443#L25 assume !(~n <= 0); 912262#L26 call #t~ret0 := fact(~n - 1);< 912355#factENTRY ~n := #in~n; 912452#L25 assume !(~n <= 0); 912243#L26 call #t~ret0 := fact(~n - 1);< 912380#factENTRY ~n := #in~n; 912431#L25 assume !(~n <= 0); 912244#L26 call #t~ret0 := fact(~n - 1);< 912302#factENTRY ~n := #in~n; 912455#L25 assume !(~n <= 0); 912242#L26 call #t~ret0 := fact(~n - 1);< 912454#factENTRY ~n := #in~n; 912457#L25 assume ~n <= 0;#res := 1; 912456#factFINAL assume true; 912453#factEXIT >#66#return; 912451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912450#factFINAL assume true; 912447#factEXIT >#66#return; 912442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912437#factFINAL assume true; 912241#factEXIT >#66#return; 912248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912375#factFINAL assume true; 912372#factEXIT >#66#return; 912342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912593#factFINAL assume true; 912591#factEXIT >#78#return; 912212#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; 912211#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 912210#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 912209#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 912208#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 912207#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 912206#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 912194#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; 912184#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 912185#factENTRY ~n := #in~n; 912203#L25 assume !(~n <= 0); 912200#L26 call #t~ret0 := fact(~n - 1);< 912201#factENTRY ~n := #in~n; 912204#L25 assume ~n <= 0;#res := 1; 912202#factFINAL assume true; 912199#factEXIT >#66#return; 912196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912193#factFINAL assume true; 912183#factEXIT >#68#return; 912089#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912179#factENTRY ~n := #in~n; 912192#L25 assume ~n <= 0;#res := 1; 912182#factFINAL assume true; 912064#factEXIT >#70#return; 912060#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 912061#factENTRY ~n := #in~n; 912191#L25 assume !(~n <= 0); 912187#L26 call #t~ret0 := fact(~n - 1);< 912190#factENTRY ~n := #in~n; 912197#L25 assume ~n <= 0;#res := 1; 912195#factFINAL assume true; 912186#factEXIT >#66#return; 912181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 912063#factFINAL assume true; 912059#factEXIT >#72#return; 912057#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; 912056#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 912055#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 912053#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 912051#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; 911963#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 911964#factENTRY ~n := #in~n; 912198#L25 assume !(~n <= 0); 912188#L26 call #t~ret0 := fact(~n - 1);< 912190#factENTRY ~n := #in~n; 912197#L25 assume ~n <= 0;#res := 1; 912195#factFINAL assume true; 912186#factEXIT >#66#return; 912189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914422#factFINAL assume true; 914420#factEXIT >#68#return; 914416#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914417#factENTRY ~n := #in~n; 914441#L25 assume !(~n <= 0); 914150#L26 call #t~ret0 := fact(~n - 1);< 914170#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914419#factFINAL assume true; 914415#factEXIT >#70#return; 914346#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914347#factENTRY ~n := #in~n; 914372#L25 assume ~n <= 0;#res := 1; 914370#factFINAL assume true; 914345#factEXIT >#72#return; 914337#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; 914296#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 914295#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 914293#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 914174#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; 914084#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914148#factENTRY ~n := #in~n; 914465#L25 assume !(~n <= 0); 914310#L26 call #t~ret0 := fact(~n - 1);< 914448#factENTRY ~n := #in~n; 914447#L25 assume !(~n <= 0); 914308#L26 call #t~ret0 := fact(~n - 1);< 914444#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914171#factFINAL assume true; 914080#factEXIT >#74#return; 913985#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914075#factENTRY ~n := #in~n; 915101#L25 assume !(~n <= 0); 914151#L26 call #t~ret0 := fact(~n - 1);< 914176#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914076#factFINAL assume true; 913775#factEXIT >#76#return; 914001#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914075#factENTRY ~n := #in~n; 915101#L25 assume !(~n <= 0); 914151#L26 call #t~ret0 := fact(~n - 1);< 914176#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914076#factFINAL assume true; 913775#factEXIT >#78#return; 914074#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; 916719#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 916716#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 916713#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 916710#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; 916533#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 916534#factENTRY ~n := #in~n; 916615#L25 assume !(~n <= 0); 916607#L26 call #t~ret0 := fact(~n - 1);< 916614#factENTRY ~n := #in~n; 917713#L25 assume !(~n <= 0); 916604#L26 call #t~ret0 := fact(~n - 1);< 916658#factENTRY ~n := #in~n; 917713#L25 assume !(~n <= 0); 916604#L26 call #t~ret0 := fact(~n - 1);< 916658#factENTRY ~n := #in~n; 916669#L25 assume ~n <= 0;#res := 1; 916666#factFINAL assume true; 916656#factEXIT >#66#return; 916653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 916646#factFINAL assume true; 916621#factEXIT >#66#return; 916620#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 916616#factFINAL assume true; 916596#factEXIT >#66#return; 916592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 916554#factFINAL assume true; 916530#factEXIT >#74#return; 911942#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 916525#factENTRY ~n := #in~n; 918597#L25 assume !(~n <= 0); 918336#L26 call #t~ret0 := fact(~n - 1);< 918344#factENTRY ~n := #in~n; 918455#L25 assume ~n <= 0;#res := 1; 918346#factFINAL assume true; 918332#factEXIT >#66#return; 918341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 919119#factFINAL assume true; 919011#factEXIT >#76#return; 918304#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 918315#factENTRY ~n := #in~n; 919243#L25 assume !(~n <= 0); 918359#L26 call #t~ret0 := fact(~n - 1);< 918527#factENTRY ~n := #in~n; 918456#L25 assume !(~n <= 0); 918534#L26 call #t~ret0 := fact(~n - 1);< 918536#factENTRY ~n := #in~n; 918531#L25 assume ~n <= 0;#res := 1; 918554#factFINAL assume true; 918533#factEXIT >#66#return; 918532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 918524#factFINAL assume true; 918349#factEXIT >#66#return; 918370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 919335#factFINAL assume true; 918303#factEXIT >#78#return; 918293#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; 919002#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 918922#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 918584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 915927#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; 915684#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 915685#factENTRY ~n := #in~n; 917120#L25 assume !(~n <= 0); 917116#L26 call #t~ret0 := fact(~n - 1);< 917119#factENTRY ~n := #in~n; 917130#L25 assume !(~n <= 0); 917117#L26 call #t~ret0 := fact(~n - 1);< 917129#factENTRY ~n := #in~n; 917130#L25 assume !(~n <= 0); 917117#L26 call #t~ret0 := fact(~n - 1);< 917129#factENTRY ~n := #in~n; 917130#L25 assume !(~n <= 0); 917117#L26 call #t~ret0 := fact(~n - 1);< 917129#factENTRY ~n := #in~n; 917130#L25 assume !(~n <= 0); 917117#L26 call #t~ret0 := fact(~n - 1);< 917129#factENTRY ~n := #in~n; 917130#L25 assume !(~n <= 0); 917117#L26 call #t~ret0 := fact(~n - 1);< 917129#factENTRY ~n := #in~n; 917130#L25 assume !(~n <= 0); 917117#L26 call #t~ret0 := fact(~n - 1);< 917129#factENTRY ~n := #in~n; 917161#L25 assume ~n <= 0;#res := 1; 917159#factFINAL assume true; 917149#factEXIT >#66#return; 917148#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917147#factFINAL assume true; 917146#factEXIT >#66#return; 917145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917144#factFINAL assume true; 917141#factEXIT >#66#return; 917139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917137#factFINAL assume true; 917136#factEXIT >#66#return; 917135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917134#factFINAL assume true; 917133#factEXIT >#66#return; 917132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917131#factFINAL assume true; 917128#factEXIT >#66#return; 917127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917126#factFINAL assume true; 917115#factEXIT >#66#return; 917118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917107#factFINAL assume true; 917111#factEXIT >#74#return; 915633#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 915635#factENTRY ~n := #in~n; 915672#L25 assume !(~n <= 0); 911983#L26 call #t~ret0 := fact(~n - 1);< 915671#factENTRY ~n := #in~n; 915792#L25 assume ~n <= 0;#res := 1; 915750#factFINAL assume true; 915667#factEXIT >#66#return; 915665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915662#factFINAL assume true; 915632#factEXIT >#76#return; 915098#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 915631#factENTRY ~n := #in~n; 915616#L25 assume !(~n <= 0); 915538#L26 call #t~ret0 := fact(~n - 1);< 915562#factENTRY ~n := #in~n; 916351#L25 assume !(~n <= 0); 915558#L26 call #t~ret0 := fact(~n - 1);< 915579#factENTRY ~n := #in~n; 915817#L25 assume !(~n <= 0); 915575#L26 call #t~ret0 := fact(~n - 1);< 915605#factENTRY ~n := #in~n; 915990#L25 assume !(~n <= 0); 915600#L26 call #t~ret0 := fact(~n - 1);< 915706#factENTRY ~n := #in~n; 915840#L25 assume !(~n <= 0); 915622#L26 call #t~ret0 := fact(~n - 1);< 915810#factENTRY ~n := #in~n; 915844#L25 assume !(~n <= 0); 915693#L26 call #t~ret0 := fact(~n - 1);< 915828#factENTRY ~n := #in~n; 915824#L25 assume ~n <= 0;#res := 1; 915845#factFINAL assume true; 915827#factEXIT >#66#return; 915826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915802#factFINAL assume true; 915715#factEXIT >#66#return; 915716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915760#factFINAL assume true; 915688#factEXIT >#66#return; 915687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915636#factFINAL assume true; 915618#factEXIT >#66#return; 915614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915610#factFINAL assume true; 915591#factEXIT >#66#return; 915588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915582#factFINAL assume true; 915567#factEXIT >#66#return; 915577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 916251#factFINAL assume true; 916213#factEXIT >#78#return; 915095#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; 915089#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 915085#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 915063#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 915060#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 914899#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 914894#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 914570#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; 914566#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914567#factENTRY ~n := #in~n; 914583#L25 assume !(~n <= 0); 914575#L26 call #t~ret0 := fact(~n - 1);< 914579#factENTRY ~n := #in~n; 912205#L25 assume !(~n <= 0); 914574#L26 call #t~ret0 := fact(~n - 1);< 914586#factENTRY ~n := #in~n; 914589#L25 assume ~n <= 0;#res := 1; 914587#factFINAL assume true; 914585#factEXIT >#66#return; 914584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914580#factFINAL assume true; 914573#factEXIT >#66#return; 914572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914569#factFINAL assume true; 914565#factEXIT >#68#return; 912076#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912179#factENTRY ~n := #in~n; 912192#L25 assume ~n <= 0;#res := 1; 912182#factFINAL assume true; 912064#factEXIT >#70#return; 912134#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914563#factENTRY ~n := #in~n; 914571#L25 assume !(~n <= 0); 914327#L26 call #t~ret0 := fact(~n - 1);< 914568#factENTRY ~n := #in~n; 915365#L25 assume !(~n <= 0); 914328#L26 call #t~ret0 := fact(~n - 1);< 914445#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914564#factFINAL assume true; 914562#factEXIT >#72#return; 914556#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; 914554#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 914551#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 914547#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 914546#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; 914081#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914172#factENTRY ~n := #in~n; 915091#L25 assume !(~n <= 0); 914306#L26 call #t~ret0 := fact(~n - 1);< 914332#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914171#factFINAL assume true; 914080#factEXIT >#68#return; 913806#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914410#factENTRY ~n := #in~n; 914470#L25 assume !(~n <= 0); 914152#L26 call #t~ret0 := fact(~n - 1);< 914170#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914076#factFINAL assume true; 913775#factEXIT >#70#return; 914013#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914438#factENTRY ~n := #in~n; 914446#L25 assume !(~n <= 0); 914166#L26 call #t~ret0 := fact(~n - 1);< 914176#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914439#factFINAL assume true; 914423#factEXIT >#72#return; 914421#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; 914418#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 914414#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 914413#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 914412#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; 914082#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914172#factENTRY ~n := #in~n; 915091#L25 assume !(~n <= 0); 914306#L26 call #t~ret0 := fact(~n - 1);< 914332#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914171#factFINAL assume true; 914080#factEXIT >#68#return; 913831#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914410#factENTRY ~n := #in~n; 914470#L25 assume !(~n <= 0); 914152#L26 call #t~ret0 := fact(~n - 1);< 914170#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914171#factFINAL assume true; 914080#factEXIT >#70#return; 914128#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914408#factENTRY ~n := #in~n; 914411#L25 assume ~n <= 0;#res := 1; 914409#factFINAL assume true; 914373#factEXIT >#72#return; 914371#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; 914369#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 914368#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 914344#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 914336#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; 914192#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914292#factENTRY ~n := #in~n; 914463#L25 assume !(~n <= 0); 914316#L26 call #t~ret0 := fact(~n - 1);< 914448#factENTRY ~n := #in~n; 914447#L25 assume !(~n <= 0); 914308#L26 call #t~ret0 := fact(~n - 1);< 914444#factENTRY ~n := #in~n; 914447#L25 assume !(~n <= 0); 914308#L26 call #t~ret0 := fact(~n - 1);< 914444#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914333#factFINAL assume true; 914178#factEXIT >#74#return; 914083#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914173#factENTRY ~n := #in~n; 915084#L25 assume !(~n <= 0); 914164#L26 call #t~ret0 := fact(~n - 1);< 914170#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914171#factFINAL assume true; 914080#factEXIT >#76#return; 913864#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914078#factENTRY ~n := #in~n; 915102#L25 assume !(~n <= 0); 914165#L26 call #t~ret0 := fact(~n - 1);< 914170#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914076#factFINAL assume true; 913775#factEXIT >#78#return; 911973#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; 911974#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 916808#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 916790#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 915800#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; 915801#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 916534#factENTRY ~n := #in~n; 916615#L25 assume !(~n <= 0); 916607#L26 call #t~ret0 := fact(~n - 1);< 916614#factENTRY ~n := #in~n; 917713#L25 assume !(~n <= 0); 916604#L26 call #t~ret0 := fact(~n - 1);< 916658#factENTRY ~n := #in~n; 917713#L25 assume !(~n <= 0); 916604#L26 call #t~ret0 := fact(~n - 1);< 916658#factENTRY ~n := #in~n; 916669#L25 assume ~n <= 0;#res := 1; 916666#factFINAL assume true; 916656#factEXIT >#66#return; 916653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 916646#factFINAL assume true; 916621#factEXIT >#66#return; 916620#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 916616#factFINAL assume true; 916596#factEXIT >#66#return; 916592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 916554#factFINAL assume true; 916530#factEXIT >#74#return; 911943#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 916524#factENTRY ~n := #in~n; 917006#L25 assume !(~n <= 0); 916996#L26 call #t~ret0 := fact(~n - 1);< 917004#factENTRY ~n := #in~n; 917017#L25 assume !(~n <= 0); 917692#L26 call #t~ret0 := fact(~n - 1);< 917694#factENTRY ~n := #in~n; 917554#L25 assume ~n <= 0;#res := 1; 917700#factFINAL assume true; 917691#factEXIT >#66#return; 917690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917659#factFINAL assume true; 917308#factEXIT >#66#return; 917314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 918815#factFINAL assume true; 918814#factEXIT >#76#return; 915924#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 915925#factENTRY ~n := #in~n; 917771#L25 assume !(~n <= 0); 917312#L26 call #t~ret0 := fact(~n - 1);< 917324#factENTRY ~n := #in~n; 917017#L25 assume !(~n <= 0); 917692#L26 call #t~ret0 := fact(~n - 1);< 917694#factENTRY ~n := #in~n; 917554#L25 assume ~n <= 0;#res := 1; 917700#factFINAL assume true; 917691#factEXIT >#66#return; 917690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917659#factFINAL assume true; 917308#factEXIT >#66#return; 917320#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917729#factFINAL assume true; 917728#factEXIT >#78#return; 915897#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; 915894#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 915891#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 915873#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 915655#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; 915444#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 915654#factENTRY ~n := #in~n; 915841#L25 assume !(~n <= 0); 915460#L26 call #t~ret0 := fact(~n - 1);< 915725#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915824#L25 assume ~n <= 0;#res := 1; 915845#factFINAL assume true; 915827#factEXIT >#66#return; 915826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915802#factFINAL assume true; 915715#factEXIT >#66#return; 915716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915760#factFINAL assume true; 915688#factEXIT >#66#return; 915687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915636#factFINAL assume true; 915618#factEXIT >#66#return; 915614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915610#factFINAL assume true; 915591#factEXIT >#66#return; 915588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915582#factFINAL assume true; 915567#factEXIT >#66#return; 915565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915563#factFINAL assume true; 915552#factEXIT >#66#return; 915551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915548#factFINAL assume true; 915536#factEXIT >#66#return; 915535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915530#factFINAL assume true; 915524#factEXIT >#66#return; 915523#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915519#factFINAL assume true; 915514#factEXIT >#66#return; 915515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 919151#factFINAL assume true; 915766#factEXIT >#74#return; 915649#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 915652#factENTRY ~n := #in~n; 915729#L25 assume !(~n <= 0); 911978#L26 call #t~ret0 := fact(~n - 1);< 915671#factENTRY ~n := #in~n; 915793#L25 assume !(~n <= 0); 911977#L26 call #t~ret0 := fact(~n - 1);< 911987#factENTRY ~n := #in~n; 915824#L25 assume ~n <= 0;#res := 1; 915845#factFINAL assume true; 915827#factEXIT >#66#return; 915826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915802#factFINAL assume true; 915715#factEXIT >#66#return; 915714#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915666#factFINAL assume true; 915643#factEXIT >#76#return; 915423#L30-7 [2022-11-18 20:36:31,331 INFO L750 eck$LassoCheckResult]: Loop: 915423#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 915590#factENTRY ~n := #in~n; 915587#L25 assume !(~n <= 0); 915525#L26 call #t~ret0 := fact(~n - 1);< 915550#factENTRY ~n := #in~n; 915613#L25 assume !(~n <= 0); 915543#L26 call #t~ret0 := fact(~n - 1);< 915562#factENTRY ~n := #in~n; 916351#L25 assume !(~n <= 0); 915558#L26 call #t~ret0 := fact(~n - 1);< 915579#factENTRY ~n := #in~n; 915817#L25 assume !(~n <= 0); 915575#L26 call #t~ret0 := fact(~n - 1);< 915605#factENTRY ~n := #in~n; 915990#L25 assume !(~n <= 0); 915600#L26 call #t~ret0 := fact(~n - 1);< 915706#factENTRY ~n := #in~n; 915840#L25 assume !(~n <= 0); 915622#L26 call #t~ret0 := fact(~n - 1);< 915810#factENTRY ~n := #in~n; 915844#L25 assume !(~n <= 0); 915693#L26 call #t~ret0 := fact(~n - 1);< 915828#factENTRY ~n := #in~n; 915835#L25 assume !(~n <= 0); 911984#L26 call #t~ret0 := fact(~n - 1);< 915832#factENTRY ~n := #in~n; 915793#L25 assume !(~n <= 0); 911977#L26 call #t~ret0 := fact(~n - 1);< 911987#factENTRY ~n := #in~n; 915824#L25 assume ~n <= 0;#res := 1; 915845#factFINAL assume true; 915827#factEXIT >#66#return; 915826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915802#factFINAL assume true; 915715#factEXIT >#66#return; 915716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915760#factFINAL assume true; 915688#factEXIT >#66#return; 915687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915636#factFINAL assume true; 915618#factEXIT >#66#return; 915614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915610#factFINAL assume true; 915591#factEXIT >#66#return; 915588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915582#factFINAL assume true; 915567#factEXIT >#66#return; 915565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915563#factFINAL assume true; 915552#factEXIT >#66#return; 915551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915548#factFINAL assume true; 915536#factEXIT >#66#return; 915535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915530#factFINAL assume true; 915524#factEXIT >#66#return; 915528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915657#factFINAL assume true; 915653#factEXIT >#78#return; 915432#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; 917166#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 917160#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 917158#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 917157#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 917156#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 917155#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 917154#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; 914598#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914603#factENTRY ~n := #in~n; 914601#L25 assume !(~n <= 0); 914577#L26 call #t~ret0 := fact(~n - 1);< 914579#factENTRY ~n := #in~n; 912205#L25 assume !(~n <= 0); 914574#L26 call #t~ret0 := fact(~n - 1);< 914586#factENTRY ~n := #in~n; 912205#L25 assume !(~n <= 0); 914574#L26 call #t~ret0 := fact(~n - 1);< 914586#factENTRY ~n := #in~n; 912205#L25 assume !(~n <= 0); 914574#L26 call #t~ret0 := fact(~n - 1);< 914586#factENTRY ~n := #in~n; 914589#L25 assume ~n <= 0;#res := 1; 914587#factFINAL assume true; 914585#factEXIT >#66#return; 914584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914580#factFINAL assume true; 914573#factEXIT >#66#return; 914578#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915050#factFINAL assume true; 915048#factEXIT >#66#return; 915047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915046#factFINAL assume true; 915044#factEXIT >#66#return; 915045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915164#factFINAL assume true; 915161#factEXIT >#68#return; 912068#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912179#factENTRY ~n := #in~n; 912192#L25 assume ~n <= 0;#res := 1; 912182#factFINAL assume true; 912064#factEXIT >#70#return; 912126#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914853#factENTRY ~n := #in~n; 914851#L25 assume !(~n <= 0); 914841#L26 call #t~ret0 := fact(~n - 1);< 914845#factENTRY ~n := #in~n; 914880#L25 assume !(~n <= 0); 914352#L26 call #t~ret0 := fact(~n - 1);< 914367#factENTRY ~n := #in~n; 915056#L25 assume !(~n <= 0); 914300#L26 call #t~ret0 := fact(~n - 1);< 914332#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914850#factFINAL assume true; 914839#factEXIT >#66#return; 914844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915166#factFINAL assume true; 915158#factEXIT >#72#return; 915160#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; 917153#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 917152#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 917151#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 917150#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; 914216#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914753#factENTRY ~n := #in~n; 914752#L25 assume !(~n <= 0); 914353#L26 call #t~ret0 := fact(~n - 1);< 914742#factENTRY ~n := #in~n; 914871#L25 assume !(~n <= 0); 914304#L26 call #t~ret0 := fact(~n - 1);< 914775#factENTRY ~n := #in~n; 914962#L25 assume !(~n <= 0); 914303#L26 call #t~ret0 := fact(~n - 1);< 914626#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914333#factFINAL assume true; 914178#factEXIT >#68#return; 913965#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 912032#factENTRY ~n := #in~n; 914466#L25 assume !(~n <= 0); 914153#L26 call #t~ret0 := fact(~n - 1);< 914449#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914076#factFINAL assume true; 913775#factEXIT >#70#return; 914044#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 915059#factENTRY ~n := #in~n; 915148#L25 assume !(~n <= 0); 914319#L26 call #t~ret0 := fact(~n - 1);< 914332#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915062#factFINAL assume true; 915143#factEXIT >#72#return; 915145#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; 919406#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 919405#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 919404#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 919403#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; 914226#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914334#factENTRY ~n := #in~n; 914873#L25 assume !(~n <= 0); 914359#L26 call #t~ret0 := fact(~n - 1);< 915052#factENTRY ~n := #in~n; 915051#L25 assume !(~n <= 0); 914317#L26 call #t~ret0 := fact(~n - 1);< 914445#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914333#factFINAL assume true; 914178#factEXIT >#68#return; 913989#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914077#factENTRY ~n := #in~n; 914521#L25 assume !(~n <= 0); 914167#L26 call #t~ret0 := fact(~n - 1);< 914366#factENTRY ~n := #in~n; 914755#L25 assume !(~n <= 0); 914299#L26 call #t~ret0 := fact(~n - 1);< 914445#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914171#factFINAL assume true; 914080#factEXIT >#70#return; 914145#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914740#factENTRY ~n := #in~n; 914726#L25 assume !(~n <= 0); 914161#L26 call #t~ret0 := fact(~n - 1);< 914170#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914439#factFINAL assume true; 914423#factEXIT >#72#return; 914437#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; 919402#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 919401#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 919400#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 919399#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; 914230#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914334#factENTRY ~n := #in~n; 914873#L25 assume !(~n <= 0); 914359#L26 call #t~ret0 := fact(~n - 1);< 915052#factENTRY ~n := #in~n; 915051#L25 assume !(~n <= 0); 914317#L26 call #t~ret0 := fact(~n - 1);< 914445#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914333#factFINAL assume true; 914178#factEXIT >#68#return; 913993#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914077#factENTRY ~n := #in~n; 914521#L25 assume !(~n <= 0); 914167#L26 call #t~ret0 := fact(~n - 1);< 914366#factENTRY ~n := #in~n; 914755#L25 assume !(~n <= 0); 914299#L26 call #t~ret0 := fact(~n - 1);< 914445#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914333#factFINAL assume true; 914178#factEXIT >#70#return; 914289#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914408#factENTRY ~n := #in~n; 914411#L25 assume ~n <= 0;#res := 1; 914409#factFINAL assume true; 914373#factEXIT >#72#return; 914402#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; 915368#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 915369#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 915361#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 915362#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; 914450#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 914468#factENTRY ~n := #in~n; 914461#L25 assume !(~n <= 0); 914312#L26 call #t~ret0 := fact(~n - 1);< 914448#factENTRY ~n := #in~n; 914447#L25 assume !(~n <= 0); 914308#L26 call #t~ret0 := fact(~n - 1);< 914444#factENTRY ~n := #in~n; 914447#L25 assume !(~n <= 0); 914308#L26 call #t~ret0 := fact(~n - 1);< 914444#factENTRY ~n := #in~n; 914447#L25 assume !(~n <= 0); 914308#L26 call #t~ret0 := fact(~n - 1);< 914444#factENTRY ~n := #in~n; 914447#L25 assume !(~n <= 0); 914308#L26 call #t~ret0 := fact(~n - 1);< 914444#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914850#factFINAL assume true; 914839#factEXIT >#66#return; 914835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914832#factFINAL assume true; 914822#factEXIT >#66#return; 914827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915192#factFINAL assume true; 914471#factEXIT >#74#return; 914238#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 914335#factENTRY ~n := #in~n; 914877#L25 assume !(~n <= 0); 914358#L26 call #t~ret0 := fact(~n - 1);< 914367#factENTRY ~n := #in~n; 915056#L25 assume !(~n <= 0); 914300#L26 call #t~ret0 := fact(~n - 1);< 914332#factENTRY ~n := #in~n; 914885#L25 assume !(~n <= 0); 914443#L26 call #t~ret0 := fact(~n - 1);< 914780#factENTRY ~n := #in~n; 914765#L25 assume ~n <= 0;#res := 1; 914763#factFINAL assume true; 914442#factEXIT >#66#return; 914348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914338#factFINAL assume true; 914297#factEXIT >#66#return; 914330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914612#factFINAL assume true; 914349#factEXIT >#66#return; 914343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914333#factFINAL assume true; 914178#factEXIT >#76#return; 913995#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 914078#factENTRY ~n := #in~n; 915102#L25 assume !(~n <= 0); 914165#L26 call #t~ret0 := fact(~n - 1);< 914170#factENTRY ~n := #in~n; 914294#L25 assume ~n <= 0;#res := 1; 914175#factFINAL assume true; 914149#factEXIT >#66#return; 914079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 914076#factFINAL assume true; 913775#factEXIT >#78#return; 914057#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; 919398#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 919397#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 919396#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 917363#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; 915973#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 915989#factENTRY ~n := #in~n; 919041#L25 assume !(~n <= 0); 918774#L26 call #t~ret0 := fact(~n - 1);< 919040#factENTRY ~n := #in~n; 919350#L25 assume !(~n <= 0); 918784#L26 call #t~ret0 := fact(~n - 1);< 919254#factENTRY ~n := #in~n; 919350#L25 assume !(~n <= 0); 918784#L26 call #t~ret0 := fact(~n - 1);< 919254#factENTRY ~n := #in~n; 919350#L25 assume !(~n <= 0); 918784#L26 call #t~ret0 := fact(~n - 1);< 919254#factENTRY ~n := #in~n; 919122#L25 assume ~n <= 0;#res := 1; 919261#factFINAL assume true; 919250#factEXIT >#66#return; 919249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 919244#factFINAL assume true; 918947#factEXIT >#66#return; 918945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 918923#factFINAL assume true; 918886#factEXIT >#66#return; 918897#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 918917#factFINAL assume true; 918904#factEXIT >#66#return; 918767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 918728#factFINAL assume true; 918729#factEXIT >#74#return; 915988#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 916665#factENTRY ~n := #in~n; 917488#L25 assume !(~n <= 0); 917284#L26 call #t~ret0 := fact(~n - 1);< 917298#factENTRY ~n := #in~n; 917703#L25 assume !(~n <= 0); 917309#L26 call #t~ret0 := fact(~n - 1);< 917324#factENTRY ~n := #in~n; 917017#L25 assume !(~n <= 0); 917692#L26 call #t~ret0 := fact(~n - 1);< 917694#factENTRY ~n := #in~n; 917554#L25 assume ~n <= 0;#res := 1; 917700#factFINAL assume true; 917691#factEXIT >#66#return; 917690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917659#factFINAL assume true; 917308#factEXIT >#66#return; 917307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917299#factFINAL assume true; 917281#factEXIT >#66#return; 917292#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917635#factFINAL assume true; 917634#factEXIT >#76#return; 915905#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 915920#factENTRY ~n := #in~n; 917660#L25 assume !(~n <= 0); 917311#L26 call #t~ret0 := fact(~n - 1);< 917324#factENTRY ~n := #in~n; 917017#L25 assume !(~n <= 0); 917692#L26 call #t~ret0 := fact(~n - 1);< 917694#factENTRY ~n := #in~n; 917554#L25 assume ~n <= 0;#res := 1; 917700#factFINAL assume true; 917691#factEXIT >#66#return; 917690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 917659#factFINAL assume true; 917308#factEXIT >#66#return; 917318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 918818#factFINAL assume true; 915903#factEXIT >#78#return; 915909#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; 917631#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 917629#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 917626#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 917623#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; 915449#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 915654#factENTRY ~n := #in~n; 915841#L25 assume !(~n <= 0); 915460#L26 call #t~ret0 := fact(~n - 1);< 915725#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915837#L25 assume !(~n <= 0); 915480#L26 call #t~ret0 := fact(~n - 1);< 915831#factENTRY ~n := #in~n; 915824#L25 assume ~n <= 0;#res := 1; 915845#factFINAL assume true; 915827#factEXIT >#66#return; 915826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915802#factFINAL assume true; 915715#factEXIT >#66#return; 915716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915760#factFINAL assume true; 915688#factEXIT >#66#return; 915687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915636#factFINAL assume true; 915618#factEXIT >#66#return; 915614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915610#factFINAL assume true; 915591#factEXIT >#66#return; 915588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915582#factFINAL assume true; 915567#factEXIT >#66#return; 915565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915563#factFINAL assume true; 915552#factEXIT >#66#return; 915551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915548#factFINAL assume true; 915536#factEXIT >#66#return; 915535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915530#factFINAL assume true; 915524#factEXIT >#66#return; 915523#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915519#factFINAL assume true; 915514#factEXIT >#66#return; 915515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 919151#factFINAL assume true; 915766#factEXIT >#74#return; 915391#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 915759#factENTRY ~n := #in~n; 915785#L25 assume !(~n <= 0); 915689#L26 call #t~ret0 := fact(~n - 1);< 915704#factENTRY ~n := #in~n; 915862#L25 assume !(~n <= 0); 911981#L26 call #t~ret0 := fact(~n - 1);< 915807#factENTRY ~n := #in~n; 915793#L25 assume !(~n <= 0); 911977#L26 call #t~ret0 := fact(~n - 1);< 911987#factENTRY ~n := #in~n; 915824#L25 assume ~n <= 0;#res := 1; 915845#factFINAL assume true; 915827#factEXIT >#66#return; 915826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915802#factFINAL assume true; 915715#factEXIT >#66#return; 915716#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915760#factFINAL assume true; 915688#factEXIT >#66#return; 915696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 915758#factFINAL assume true; 915387#factEXIT >#76#return; 915423#L30-7 [2022-11-18 20:36:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1908819100, now seen corresponding path program 60 times [2022-11-18 20:36:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:31,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399185274] [2022-11-18 20:36:31,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:31,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:31,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167038805] [2022-11-18 20:36:31,376 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:36:31,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:31,378 INFO L229 MonitoredProcess]: Starting monitored process 331 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:31,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (331)] Waiting until timeout for monitored process [2022-11-18 20:36:33,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-11-18 20:36:33,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:33,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:36:33,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 43781 backedges. 9887 proven. 151 refuted. 0 times theorem prover too weak. 33743 trivial. 0 not checked. [2022-11-18 20:36:34,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 43781 backedges. 1367 proven. 284 refuted. 0 times theorem prover too weak. 42130 trivial. 0 not checked. [2022-11-18 20:36:35,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399185274] [2022-11-18 20:36:35,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:35,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167038805] [2022-11-18 20:36:35,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167038805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:35,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:35,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 18 [2022-11-18 20:36:35,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650485904] [2022-11-18 20:36:35,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:35,253 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:36:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 885753617, now seen corresponding path program 44 times [2022-11-18 20:36:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:35,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422672537] [2022-11-18 20:36:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:35,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:35,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:35,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368647047] [2022-11-18 20:36:35,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:36:35,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:35,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:35,297 INFO L229 MonitoredProcess]: Starting monitored process 332 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:35,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (332)] Waiting until timeout for monitored process [2022-11-18 20:36:37,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:36:37,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:37,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-18 20:36:37,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19369 backedges. 8601 proven. 199 refuted. 0 times theorem prover too weak. 10569 trivial. 0 not checked. [2022-11-18 20:36:37,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19369 backedges. 561 proven. 2349 refuted. 0 times theorem prover too weak. 16459 trivial. 0 not checked. [2022-11-18 20:36:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422672537] [2022-11-18 20:36:39,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368647047] [2022-11-18 20:36:39,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368647047] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:39,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:39,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 24 [2022-11-18 20:36:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810676325] [2022-11-18 20:36:39,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:39,752 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:36:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:39,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 20:36:39,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-11-18 20:36:39,753 INFO L87 Difference]: Start difference. First operand 7503 states and 15854 transitions. cyclomatic complexity: 8417 Second operand has 24 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 24 states have internal predecessors, (69), 15 states have call successors, (29), 2 states have call predecessors, (29), 10 states have return successors, (33), 10 states have call predecessors, (33), 15 states have call successors, (33) [2022-11-18 20:36:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:41,226 INFO L93 Difference]: Finished difference Result 7830 states and 16428 transitions. [2022-11-18 20:36:41,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7830 states and 16428 transitions. [2022-11-18 20:36:41,311 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1273 [2022-11-18 20:36:41,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7830 states to 7806 states and 16315 transitions. [2022-11-18 20:36:41,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2573 [2022-11-18 20:36:41,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2573 [2022-11-18 20:36:41,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7806 states and 16315 transitions. [2022-11-18 20:36:41,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:36:41,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7806 states and 16315 transitions. [2022-11-18 20:36:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states and 16315 transitions. [2022-11-18 20:36:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 7582. [2022-11-18 20:36:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7582 states, 4361 states have (on average 1.0382939692731026) internal successors, (4528), 4340 states have internal predecessors, (4528), 2445 states have call successors, (2546), 1024 states have call predecessors, (2546), 776 states have return successors, (8888), 2217 states have call predecessors, (8888), 2445 states have call successors, (8888) [2022-11-18 20:36:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 15962 transitions. [2022-11-18 20:36:41,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7582 states and 15962 transitions. [2022-11-18 20:36:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:36:41,688 INFO L428 stractBuchiCegarLoop]: Abstraction has 7582 states and 15962 transitions. [2022-11-18 20:36:41,688 INFO L335 stractBuchiCegarLoop]: ======== Iteration 77 ============ [2022-11-18 20:36:41,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7582 states and 15962 transitions. [2022-11-18 20:36:41,728 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1273 [2022-11-18 20:36:41,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:36:41,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:36:41,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [149, 149, 102, 102, 102, 102, 47, 16, 15, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:36:41,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [85, 85, 64, 64, 64, 64, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:36:41,733 INFO L748 eck$LassoCheckResult]: Stem: 935704#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 935675#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; 935676#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 935703#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; 935757#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 935768#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 935766#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; 935764#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 935765#factENTRY ~n := #in~n; 935773#L25 assume ~n <= 0;#res := 1; 935771#factFINAL assume true; 935763#factEXIT >#68#return; 935750#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 935751#factENTRY ~n := #in~n; 935769#L25 assume ~n <= 0;#res := 1; 935767#factFINAL assume true; 935762#factEXIT >#70#return; 935658#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 935659#factENTRY ~n := #in~n; 935778#L25 assume ~n <= 0;#res := 1; 935777#factFINAL assume true; 935776#factEXIT >#72#return; 935775#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; 935698#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 935699#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 936461#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 936460#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; 936458#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 936459#factENTRY ~n := #in~n; 936468#L25 assume !(~n <= 0); 936465#L26 call #t~ret0 := fact(~n - 1);< 936466#factENTRY ~n := #in~n; 936475#L25 assume ~n <= 0;#res := 1; 936473#factFINAL assume true; 936464#factEXIT >#66#return; 936463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936462#factFINAL assume true; 936457#factEXIT >#74#return; 936455#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 936456#factENTRY ~n := #in~n; 936474#L25 assume ~n <= 0;#res := 1; 936471#factFINAL assume true; 936454#factEXIT >#76#return; 936439#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 936440#factENTRY ~n := #in~n; 936472#L25 assume !(~n <= 0); 936452#L26 call #t~ret0 := fact(~n - 1);< 936453#factENTRY ~n := #in~n; 936470#L25 assume ~n <= 0;#res := 1; 936469#factFINAL assume true; 936451#factEXIT >#66#return; 936449#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936447#factFINAL assume true; 936438#factEXIT >#78#return; 936436#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; 936435#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 936430#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 936426#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 936420#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; 936404#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 936405#factENTRY ~n := #in~n; 936419#L25 assume !(~n <= 0); 936417#L26 call #t~ret0 := fact(~n - 1);< 936418#factENTRY ~n := #in~n; 936443#L25 assume !(~n <= 0); 936416#L26 call #t~ret0 := fact(~n - 1);< 936434#factENTRY ~n := #in~n; 936441#L25 assume ~n <= 0;#res := 1; 936437#factFINAL assume true; 936433#factEXIT >#66#return; 936429#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936425#factFINAL assume true; 936415#factEXIT >#66#return; 936414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936413#factFINAL assume true; 936403#factEXIT >#74#return; 936399#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 936400#factENTRY ~n := #in~n; 936412#L25 assume ~n <= 0;#res := 1; 936402#factFINAL assume true; 936398#factEXIT >#76#return; 936395#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 936396#factENTRY ~n := #in~n; 936428#L25 assume !(~n <= 0); 936409#L26 call #t~ret0 := fact(~n - 1);< 936411#factENTRY ~n := #in~n; 936445#L25 assume !(~n <= 0); 936408#L26 call #t~ret0 := fact(~n - 1);< 936432#factENTRY ~n := #in~n; 936444#L25 assume ~n <= 0;#res := 1; 936442#factFINAL assume true; 936431#factEXIT >#66#return; 936427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936421#factFINAL assume true; 936406#factEXIT >#66#return; 936401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936397#factFINAL assume true; 936394#factEXIT >#78#return; 936393#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; 936392#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 936391#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 936390#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 936389#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; 936360#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 936467#factENTRY ~n := #in~n; 936386#L25 assume !(~n <= 0); 936387#L26 call #t~ret0 := fact(~n - 1);< 936411#factENTRY ~n := #in~n; 936445#L25 assume !(~n <= 0); 936408#L26 call #t~ret0 := fact(~n - 1);< 936432#factENTRY ~n := #in~n; 936445#L25 assume !(~n <= 0); 936408#L26 call #t~ret0 := fact(~n - 1);< 936432#factENTRY ~n := #in~n; 936444#L25 assume ~n <= 0;#res := 1; 936442#factFINAL assume true; 936431#factEXIT >#66#return; 936427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936421#factFINAL assume true; 936406#factEXIT >#66#return; 936410#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936480#factFINAL assume true; 936476#factEXIT >#66#return; 936369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936370#factFINAL assume true; 936359#factEXIT >#74#return; 936344#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 936350#factENTRY ~n := #in~n; 937077#L25 assume ~n <= 0;#res := 1; 937075#factFINAL assume true; 936783#factEXIT >#76#return; 936784#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 937224#factENTRY ~n := #in~n; 937225#L25 assume !(~n <= 0); 937184#L26 call #t~ret0 := fact(~n - 1);< 937229#factENTRY ~n := #in~n; 937244#L25 assume !(~n <= 0); 937188#L26 call #t~ret0 := fact(~n - 1);< 937195#factENTRY ~n := #in~n; 937241#L25 assume !(~n <= 0); 937173#L26 call #t~ret0 := fact(~n - 1);< 937240#factENTRY ~n := #in~n; 937246#L25 assume ~n <= 0;#res := 1; 937245#factFINAL assume true; 937239#factEXIT >#66#return; 937238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937237#factFINAL assume true; 937234#factEXIT >#66#return; 937232#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937230#factFINAL assume true; 937227#factEXIT >#66#return; 937194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937298#factFINAL assume true; 937254#factEXIT >#78#return; 936143#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; 936134#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 936133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 936129#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 936063#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; 936052#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 936053#factENTRY ~n := #in~n; 936078#L25 assume !(~n <= 0); 936076#L26 call #t~ret0 := fact(~n - 1);< 936077#factENTRY ~n := #in~n; 936105#L25 assume !(~n <= 0); 936075#L26 call #t~ret0 := fact(~n - 1);< 936094#factENTRY ~n := #in~n; 936105#L25 assume !(~n <= 0); 936075#L26 call #t~ret0 := fact(~n - 1);< 936094#factENTRY ~n := #in~n; 936105#L25 assume !(~n <= 0); 936075#L26 call #t~ret0 := fact(~n - 1);< 936094#factENTRY ~n := #in~n; 936105#L25 assume !(~n <= 0); 936075#L26 call #t~ret0 := fact(~n - 1);< 936094#factENTRY ~n := #in~n; 936105#L25 assume !(~n <= 0); 936075#L26 call #t~ret0 := fact(~n - 1);< 936094#factENTRY ~n := #in~n; 936105#L25 assume !(~n <= 0); 936075#L26 call #t~ret0 := fact(~n - 1);< 936094#factENTRY ~n := #in~n; 936105#L25 assume !(~n <= 0); 936075#L26 call #t~ret0 := fact(~n - 1);< 936094#factENTRY ~n := #in~n; 936138#L25 assume ~n <= 0;#res := 1; 936137#factFINAL assume true; 936127#factEXIT >#66#return; 936126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936125#factFINAL assume true; 936121#factEXIT >#66#return; 936119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936117#factFINAL assume true; 936113#factEXIT >#66#return; 936111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936109#factFINAL assume true; 936108#factEXIT >#66#return; 936107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936104#factFINAL assume true; 936103#factEXIT >#66#return; 936102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936101#factFINAL assume true; 936100#factEXIT >#66#return; 936098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936096#factFINAL assume true; 936093#factEXIT >#66#return; 936090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936082#factFINAL assume true; 936074#factEXIT >#66#return; 936062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936061#factFINAL assume true; 936051#factEXIT >#74#return; 935939#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 935942#factENTRY ~n := #in~n; 935941#L25 assume ~n <= 0;#res := 1; 935938#factFINAL assume true; 935940#factEXIT >#76#return; 935996#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 936057#factENTRY ~n := #in~n; 936055#L25 assume !(~n <= 0); 935980#L26 call #t~ret0 := fact(~n - 1);< 935987#factENTRY ~n := #in~n; 936130#L25 assume !(~n <= 0); 935976#L26 call #t~ret0 := fact(~n - 1);< 936060#factENTRY ~n := #in~n; 936124#L25 assume !(~n <= 0); 935974#L26 call #t~ret0 := fact(~n - 1);< 936081#factENTRY ~n := #in~n; 936106#L25 assume !(~n <= 0); 935972#L26 call #t~ret0 := fact(~n - 1);< 936072#factENTRY ~n := #in~n; 936169#L25 assume !(~n <= 0); 935962#L26 call #t~ret0 := fact(~n - 1);< 936097#factENTRY ~n := #in~n; 936148#L25 assume !(~n <= 0); 935959#L26 call #t~ret0 := fact(~n - 1);< 936019#factENTRY ~n := #in~n; 936172#L25 assume !(~n <= 0); 935961#L26 call #t~ret0 := fact(~n - 1);< 936171#factENTRY ~n := #in~n; 936172#L25 assume !(~n <= 0); 935961#L26 call #t~ret0 := fact(~n - 1);< 936171#factENTRY ~n := #in~n; 936172#L25 assume !(~n <= 0); 935961#L26 call #t~ret0 := fact(~n - 1);< 936171#factENTRY ~n := #in~n; 936172#L25 assume !(~n <= 0); 935961#L26 call #t~ret0 := fact(~n - 1);< 936171#factENTRY ~n := #in~n; 936172#L25 assume !(~n <= 0); 935961#L26 call #t~ret0 := fact(~n - 1);< 936171#factENTRY ~n := #in~n; 936172#L25 assume !(~n <= 0); 935961#L26 call #t~ret0 := fact(~n - 1);< 936171#factENTRY ~n := #in~n; 936172#L25 assume !(~n <= 0); 935961#L26 call #t~ret0 := fact(~n - 1);< 936171#factENTRY ~n := #in~n; 936174#L25 assume ~n <= 0;#res := 1; 936173#factFINAL assume true; 936170#factEXIT >#66#return; 936168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936167#factFINAL assume true; 936164#factEXIT >#66#return; 936159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936154#factFINAL assume true; 935958#factEXIT >#66#return; 935965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936092#factFINAL assume true; 936089#factEXIT >#66#return; 936088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936085#factFINAL assume true; 936080#factEXIT >#66#return; 936073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936070#factFINAL assume true; 936058#factEXIT >#66#return; 936056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936050#factFINAL assume true; 936033#factEXIT >#66#return; 936034#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936026#factFINAL assume true; 936024#factEXIT >#66#return; 936023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936020#factFINAL assume true; 936016#factEXIT >#66#return; 936018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936046#factFINAL assume true; 936047#factEXIT >#66#return; 936087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936123#factFINAL assume true; 936120#factEXIT >#66#return; 936118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936116#factFINAL assume true; 935967#factEXIT >#66#return; 935986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936122#factFINAL assume true; 936114#factEXIT >#66#return; 936115#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 936136#factFINAL assume true; 936131#factEXIT >#78#return; 935929#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; 935928#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 935927#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 935926#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 935925#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 935924#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 935923#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 935912#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; 935902#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 935903#factENTRY ~n := #in~n; 935920#L25 assume !(~n <= 0); 935647#L26 call #t~ret0 := fact(~n - 1);< 935918#factENTRY ~n := #in~n; 935921#L25 assume ~n <= 0;#res := 1; 935919#factFINAL assume true; 935917#factEXIT >#66#return; 935914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 935911#factFINAL assume true; 935901#factEXIT >#68#return; 935790#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 935898#factENTRY ~n := #in~n; 935909#L25 assume ~n <= 0;#res := 1; 935900#factFINAL assume true; 935783#factEXIT >#70#return; 935780#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 935781#factENTRY ~n := #in~n; 935910#L25 assume !(~n <= 0); 935905#L26 call #t~ret0 := fact(~n - 1);< 935908#factENTRY ~n := #in~n; 935915#L25 assume ~n <= 0;#res := 1; 935913#factFINAL assume true; 935904#factEXIT >#66#return; 935899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 935782#factFINAL assume true; 935779#factEXIT >#72#return; 935701#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; 935702#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 935774#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 935772#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 935770#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; 935666#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 935667#factENTRY ~n := #in~n; 935916#L25 assume !(~n <= 0); 935906#L26 call #t~ret0 := fact(~n - 1);< 935908#factENTRY ~n := #in~n; 935915#L25 assume ~n <= 0;#res := 1; 935913#factFINAL assume true; 935904#factEXIT >#66#return; 935907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938094#factFINAL assume true; 938092#factEXIT >#68#return; 937876#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 938090#factENTRY ~n := #in~n; 938244#L25 assume !(~n <= 0); 937853#L26 call #t~ret0 := fact(~n - 1);< 937877#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938091#factFINAL assume true; 938089#factEXIT >#70#return; 937995#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 937996#factENTRY ~n := #in~n; 938068#L25 assume ~n <= 0;#res := 1; 938066#factFINAL assume true; 937994#factEXIT >#72#return; 937990#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; 937984#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 937983#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 937942#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 937874#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; 937781#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 937848#factENTRY ~n := #in~n; 938124#L25 assume !(~n <= 0); 937963#L26 call #t~ret0 := fact(~n - 1);< 938107#factENTRY ~n := #in~n; 938022#L25 assume !(~n <= 0); 937961#L26 call #t~ret0 := fact(~n - 1);< 938020#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937871#factFINAL assume true; 937780#factEXIT >#74#return; 937559#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 937775#factENTRY ~n := #in~n; 938831#L25 assume !(~n <= 0); 937859#L26 call #t~ret0 := fact(~n - 1);< 937870#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937776#factFINAL assume true; 937486#factEXIT >#76#return; 937592#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 937775#factENTRY ~n := #in~n; 938831#L25 assume !(~n <= 0); 937859#L26 call #t~ret0 := fact(~n - 1);< 937870#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937776#factFINAL assume true; 937486#factEXIT >#78#return; 935677#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; 935678#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 943183#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 943182#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 940944#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; 940940#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 940943#factENTRY ~n := #in~n; 940972#L25 assume !(~n <= 0); 940957#L26 call #t~ret0 := fact(~n - 1);< 940971#factENTRY ~n := #in~n; 942221#L25 assume !(~n <= 0); 940956#L26 call #t~ret0 := fact(~n - 1);< 942217#factENTRY ~n := #in~n; 942221#L25 assume !(~n <= 0); 940956#L26 call #t~ret0 := fact(~n - 1);< 942217#factENTRY ~n := #in~n; 942818#L25 assume ~n <= 0;#res := 1; 942817#factFINAL assume true; 942096#factEXIT >#66#return; 942090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 942082#factFINAL assume true; 942063#factEXIT >#66#return; 942062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940974#factFINAL assume true; 940953#factEXIT >#66#return; 940952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940948#factFINAL assume true; 940939#factEXIT >#74#return; 935654#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 940938#factENTRY ~n := #in~n; 940973#L25 assume !(~n <= 0); 940136#L26 call #t~ret0 := fact(~n - 1);< 940143#factENTRY ~n := #in~n; 940200#L25 assume ~n <= 0;#res := 1; 940199#factFINAL assume true; 940131#factEXIT >#66#return; 940142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 942821#factFINAL assume true; 940932#factEXIT >#76#return; 940677#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 940931#factENTRY ~n := #in~n; 940913#L25 assume !(~n <= 0); 940647#L26 call #t~ret0 := fact(~n - 1);< 940659#factENTRY ~n := #in~n; 940201#L25 assume !(~n <= 0); 940688#L26 call #t~ret0 := fact(~n - 1);< 940694#factENTRY ~n := #in~n; 940667#L25 assume ~n <= 0;#res := 1; 940806#factFINAL assume true; 940687#factEXIT >#66#return; 940683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940676#factFINAL assume true; 940643#factEXIT >#66#return; 940655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940949#factFINAL assume true; 940947#factEXIT >#78#return; 939637#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; 939636#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 939635#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 939629#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 939626#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; 935723#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 939625#factENTRY ~n := #in~n; 939992#L25 assume !(~n <= 0); 938986#L26 call #t~ret0 := fact(~n - 1);< 939751#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939550#L25 assume ~n <= 0;#res := 1; 939548#factFINAL assume true; 939513#factEXIT >#66#return; 939511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939499#factFINAL assume true; 939309#factEXIT >#66#return; 939308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939106#factFINAL assume true; 939059#factEXIT >#66#return; 939071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939288#factFINAL assume true; 939279#factEXIT >#66#return; 939278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939037#factFINAL assume true; 939020#factEXIT >#66#return; 939019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939014#factFINAL assume true; 938979#factEXIT >#66#return; 939009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940809#factFINAL assume true; 940684#factEXIT >#66#return; 940685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 941516#factFINAL assume true; 939906#factEXIT >#66#return; 939907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939919#factFINAL assume true; 939893#factEXIT >#66#return; 939894#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939879#factFINAL assume true; 939614#factEXIT >#74#return; 939607#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 939613#factENTRY ~n := #in~n; 943193#L25 assume !(~n <= 0); 939127#L26 call #t~ret0 := fact(~n - 1);< 939132#factENTRY ~n := #in~n; 939524#L25 assume ~n <= 0;#res := 1; 939332#factFINAL assume true; 939123#factEXIT >#66#return; 939129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939882#factFINAL assume true; 939623#factEXIT >#76#return; 939275#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 939634#factENTRY ~n := #in~n; 939781#L25 assume !(~n <= 0); 939271#L26 call #t~ret0 := fact(~n - 1);< 939274#factENTRY ~n := #in~n; 939273#L25 assume !(~n <= 0); 939255#L26 call #t~ret0 := fact(~n - 1);< 939258#factENTRY ~n := #in~n; 939256#L25 assume !(~n <= 0); 938983#L26 call #t~ret0 := fact(~n - 1);< 939253#factENTRY ~n := #in~n; 939252#L25 assume !(~n <= 0); 939021#L26 call #t~ret0 := fact(~n - 1);< 939034#factENTRY ~n := #in~n; 940122#L25 assume !(~n <= 0); 939280#L26 call #t~ret0 := fact(~n - 1);< 939285#factENTRY ~n := #in~n; 939463#L25 assume !(~n <= 0); 939064#L26 call #t~ret0 := fact(~n - 1);< 939109#factENTRY ~n := #in~n; 940296#L25 assume !(~n <= 0); 939313#L26 call #t~ret0 := fact(~n - 1);< 939323#factENTRY ~n := #in~n; 939525#L25 assume !(~n <= 0); 939514#L26 call #t~ret0 := fact(~n - 1);< 939516#factENTRY ~n := #in~n; 939550#L25 assume ~n <= 0;#res := 1; 939548#factFINAL assume true; 939513#factEXIT >#66#return; 939511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939499#factFINAL assume true; 939309#factEXIT >#66#return; 939308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939106#factFINAL assume true; 939059#factEXIT >#66#return; 939071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939288#factFINAL assume true; 939279#factEXIT >#66#return; 939278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939037#factFINAL assume true; 939020#factEXIT >#66#return; 939019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939014#factFINAL assume true; 938979#factEXIT >#66#return; 939009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940809#factFINAL assume true; 940684#factEXIT >#66#return; 940685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 941516#factFINAL assume true; 939906#factEXIT >#66#return; 939908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939892#factFINAL assume true; 939630#factEXIT >#78#return; 938303#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; 938298#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 938297#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 938296#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 938295#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 938293#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 938292#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 938291#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; 938279#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 938280#factENTRY ~n := #in~n; 938324#L25 assume !(~n <= 0); 935636#L26 call #t~ret0 := fact(~n - 1);< 938307#factENTRY ~n := #in~n; 935922#L25 assume !(~n <= 0); 935644#L26 call #t~ret0 := fact(~n - 1);< 938327#factENTRY ~n := #in~n; 938333#L25 assume ~n <= 0;#res := 1; 938331#factFINAL assume true; 938326#factEXIT >#66#return; 938325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938322#factFINAL assume true; 938305#factEXIT >#66#return; 938300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938287#factFINAL assume true; 938278#factEXIT >#68#return; 935789#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 935898#factENTRY ~n := #in~n; 935909#L25 assume ~n <= 0;#res := 1; 935900#factFINAL assume true; 935783#factEXIT >#70#return; 935847#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 938273#factENTRY ~n := #in~n; 938317#L25 assume !(~n <= 0); 937974#L26 call #t~ret0 := fact(~n - 1);< 938302#factENTRY ~n := #in~n; 938106#L25 assume !(~n <= 0); 937973#L26 call #t~ret0 := fact(~n - 1);< 938018#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938277#factFINAL assume true; 938272#factEXIT >#72#return; 938268#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; 938267#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 938265#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 938245#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 938242#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; 937782#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 937872#factENTRY ~n := #in~n; 943198#L25 assume !(~n <= 0); 937959#L26 call #t~ret0 := fact(~n - 1);< 937978#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937871#factFINAL assume true; 937780#factEXIT >#68#return; 937650#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 938061#factENTRY ~n := #in~n; 938024#L25 assume !(~n <= 0); 937852#L26 call #t~ret0 := fact(~n - 1);< 937877#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937776#factFINAL assume true; 937486#factEXIT >#70#return; 937753#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 938086#factENTRY ~n := #in~n; 938093#L25 assume !(~n <= 0); 937865#L26 call #t~ret0 := fact(~n - 1);< 937870#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938087#factFINAL assume true; 938071#factEXIT >#72#return; 938070#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; 938069#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 938067#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 938065#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 938064#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; 937783#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 937872#factENTRY ~n := #in~n; 943198#L25 assume !(~n <= 0); 937959#L26 call #t~ret0 := fact(~n - 1);< 937978#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937871#factFINAL assume true; 937780#factEXIT >#68#return; 937658#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 938061#factENTRY ~n := #in~n; 938024#L25 assume !(~n <= 0); 937852#L26 call #t~ret0 := fact(~n - 1);< 937877#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937871#factFINAL assume true; 937780#factEXIT >#70#return; 937841#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 938060#factENTRY ~n := #in~n; 938063#L25 assume ~n <= 0;#res := 1; 938062#factFINAL assume true; 938025#factEXIT >#72#return; 938023#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; 938021#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 938015#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 937992#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 937982#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; 937894#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 937941#factENTRY ~n := #in~n; 938123#L25 assume !(~n <= 0); 937946#L26 call #t~ret0 := fact(~n - 1);< 938107#factENTRY ~n := #in~n; 938022#L25 assume !(~n <= 0); 937961#L26 call #t~ret0 := fact(~n - 1);< 938020#factENTRY ~n := #in~n; 938022#L25 assume !(~n <= 0); 937961#L26 call #t~ret0 := fact(~n - 1);< 938020#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 937991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937979#factFINAL assume true; 937879#factEXIT >#74#return; 937784#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 937873#factENTRY ~n := #in~n; 938799#L25 assume !(~n <= 0); 937855#L26 call #t~ret0 := fact(~n - 1);< 937877#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937871#factFINAL assume true; 937780#factEXIT >#76#return; 937663#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 937778#factENTRY ~n := #in~n; 938811#L25 assume !(~n <= 0); 937867#L26 call #t~ret0 := fact(~n - 1);< 937877#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937776#factFINAL assume true; 937486#factEXIT >#78#return; 937717#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; 939104#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 939105#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 942978#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 939532#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; 939533#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 940943#factENTRY ~n := #in~n; 940972#L25 assume !(~n <= 0); 940957#L26 call #t~ret0 := fact(~n - 1);< 940971#factENTRY ~n := #in~n; 942221#L25 assume !(~n <= 0); 940956#L26 call #t~ret0 := fact(~n - 1);< 942217#factENTRY ~n := #in~n; 942221#L25 assume !(~n <= 0); 940956#L26 call #t~ret0 := fact(~n - 1);< 942217#factENTRY ~n := #in~n; 942818#L25 assume ~n <= 0;#res := 1; 942817#factFINAL assume true; 942096#factEXIT >#66#return; 942090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 942082#factFINAL assume true; 942063#factEXIT >#66#return; 942062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940974#factFINAL assume true; 940953#factEXIT >#66#return; 940952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940948#factFINAL assume true; 940939#factEXIT >#74#return; 935653#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 940938#factENTRY ~n := #in~n; 940973#L25 assume !(~n <= 0); 940136#L26 call #t~ret0 := fact(~n - 1);< 940143#factENTRY ~n := #in~n; 940201#L25 assume !(~n <= 0); 940688#L26 call #t~ret0 := fact(~n - 1);< 940694#factENTRY ~n := #in~n; 940667#L25 assume ~n <= 0;#res := 1; 940806#factFINAL assume true; 940687#factEXIT >#66#return; 940683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940676#factFINAL assume true; 940643#factEXIT >#66#return; 940657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940951#factFINAL assume true; 940950#factEXIT >#76#return; 940678#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 940931#factENTRY ~n := #in~n; 940913#L25 assume !(~n <= 0); 940647#L26 call #t~ret0 := fact(~n - 1);< 940659#factENTRY ~n := #in~n; 940201#L25 assume !(~n <= 0); 940688#L26 call #t~ret0 := fact(~n - 1);< 940694#factENTRY ~n := #in~n; 940667#L25 assume ~n <= 0;#res := 1; 940806#factFINAL assume true; 940687#factEXIT >#66#return; 940683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940676#factFINAL assume true; 940643#factEXIT >#66#return; 940655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940949#factFINAL assume true; 940947#factEXIT >#78#return; 939642#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; 941993#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 941983#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 939648#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 939619#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; 939582#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 939618#factENTRY ~n := #in~n; 942993#L25 assume !(~n <= 0); 938987#L26 call #t~ret0 := fact(~n - 1);< 939751#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939550#L25 assume ~n <= 0;#res := 1; 939548#factFINAL assume true; 939513#factEXIT >#66#return; 939511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939499#factFINAL assume true; 939309#factEXIT >#66#return; 939308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939106#factFINAL assume true; 939059#factEXIT >#66#return; 939071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939288#factFINAL assume true; 939279#factEXIT >#66#return; 939278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939037#factFINAL assume true; 939020#factEXIT >#66#return; 939019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939014#factFINAL assume true; 938979#factEXIT >#66#return; 939009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940809#factFINAL assume true; 940684#factEXIT >#66#return; 940685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 941516#factFINAL assume true; 939906#factEXIT >#66#return; 939907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939919#factFINAL assume true; 939893#factEXIT >#66#return; 939891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939888#factFINAL assume true; 939885#factEXIT >#66#return; 939884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939883#factFINAL assume true; 939624#factEXIT >#74#return; 939608#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 939613#factENTRY ~n := #in~n; 943193#L25 assume !(~n <= 0); 939127#L26 call #t~ret0 := fact(~n - 1);< 939132#factENTRY ~n := #in~n; 939525#L25 assume !(~n <= 0); 939514#L26 call #t~ret0 := fact(~n - 1);< 939516#factENTRY ~n := #in~n; 939550#L25 assume ~n <= 0;#res := 1; 939548#factFINAL assume true; 939513#factEXIT >#66#return; 939511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939499#factFINAL assume true; 939309#factEXIT >#66#return; 939317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939791#factFINAL assume true; 939603#factEXIT >#76#return; 935683#L30-7 [2022-11-18 20:36:41,733 INFO L750 eck$LassoCheckResult]: Loop: 935683#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 939725#factENTRY ~n := #in~n; 943062#L25 assume !(~n <= 0); 935681#L26 call #t~ret0 := fact(~n - 1);< 935685#factENTRY ~n := #in~n; 943105#L25 assume !(~n <= 0); 938984#L26 call #t~ret0 := fact(~n - 1);< 939013#factENTRY ~n := #in~n; 939276#L25 assume !(~n <= 0); 939006#L26 call #t~ret0 := fact(~n - 1);< 939035#factENTRY ~n := #in~n; 939464#L25 assume !(~n <= 0); 939004#L26 call #t~ret0 := fact(~n - 1);< 939110#factENTRY ~n := #in~n; 939462#L25 assume !(~n <= 0); 939027#L26 call #t~ret0 := fact(~n - 1);< 939078#factENTRY ~n := #in~n; 939732#L25 assume !(~n <= 0); 939063#L26 call #t~ret0 := fact(~n - 1);< 939325#factENTRY ~n := #in~n; 939896#L25 assume !(~n <= 0); 939062#L26 call #t~ret0 := fact(~n - 1);< 939519#factENTRY ~n := #in~n; 939890#L25 assume !(~n <= 0); 939310#L26 call #t~ret0 := fact(~n - 1);< 939517#factENTRY ~n := #in~n; 939550#L25 assume ~n <= 0;#res := 1; 939548#factFINAL assume true; 939513#factEXIT >#66#return; 939511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939499#factFINAL assume true; 939309#factEXIT >#66#return; 939308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939106#factFINAL assume true; 939059#factEXIT >#66#return; 939071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939288#factFINAL assume true; 939279#factEXIT >#66#return; 939278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939037#factFINAL assume true; 939020#factEXIT >#66#return; 939019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939014#factFINAL assume true; 938979#factEXIT >#66#return; 939009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940809#factFINAL assume true; 940684#factEXIT >#66#return; 940685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 941516#factFINAL assume true; 939906#factEXIT >#66#return; 939908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939892#factFINAL assume true; 939630#factEXIT >#78#return; 938725#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; 940291#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 940289#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 940288#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 940287#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 940286#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 940285#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 940284#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; 938881#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 935665#factENTRY ~n := #in~n; 938882#L25 assume !(~n <= 0); 935642#L26 call #t~ret0 := fact(~n - 1);< 938307#factENTRY ~n := #in~n; 935922#L25 assume !(~n <= 0); 935644#L26 call #t~ret0 := fact(~n - 1);< 938327#factENTRY ~n := #in~n; 935922#L25 assume !(~n <= 0); 935644#L26 call #t~ret0 := fact(~n - 1);< 938327#factENTRY ~n := #in~n; 938333#L25 assume ~n <= 0;#res := 1; 938331#factFINAL assume true; 938326#factEXIT >#66#return; 938325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938322#factFINAL assume true; 938305#factEXIT >#66#return; 938306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938888#factFINAL assume true; 938884#factEXIT >#66#return; 938885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938948#factFINAL assume true; 938945#factEXIT >#68#return; 935808#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 935898#factENTRY ~n := #in~n; 935909#L25 assume ~n <= 0;#res := 1; 935900#factFINAL assume true; 935783#factEXIT >#70#return; 935865#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 938339#factENTRY ~n := #in~n; 938340#L25 assume !(~n <= 0); 938004#L26 call #t~ret0 := fact(~n - 1);< 938335#factENTRY ~n := #in~n; 938814#L25 assume !(~n <= 0); 937964#L26 call #t~ret0 := fact(~n - 1);< 937978#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 938012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938946#factFINAL assume true; 938942#factEXIT >#72#return; 938939#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; 938940#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 940293#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 940292#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 940290#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; 937881#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 937980#factENTRY ~n := #in~n; 943200#L25 assume !(~n <= 0); 937999#L26 call #t~ret0 := fact(~n - 1);< 938013#factENTRY ~n := #in~n; 938334#L25 assume !(~n <= 0); 937953#L26 call #t~ret0 := fact(~n - 1);< 938018#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 937991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937979#factFINAL assume true; 937879#factEXIT >#68#return; 937547#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 937777#factENTRY ~n := #in~n; 938294#L25 assume !(~n <= 0); 937854#L26 call #t~ret0 := fact(~n - 1);< 938014#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937776#factFINAL assume true; 937486#factEXIT >#70#return; 937766#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 938637#factENTRY ~n := #in~n; 938635#L25 assume !(~n <= 0); 937970#L26 call #t~ret0 := fact(~n - 1);< 937978#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939404#factFINAL assume true; 938529#factEXIT >#72#return; 938542#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; 940283#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 940282#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 940281#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 940280#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; 937883#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 937980#factENTRY ~n := #in~n; 943200#L25 assume !(~n <= 0); 937999#L26 call #t~ret0 := fact(~n - 1);< 938013#factENTRY ~n := #in~n; 938334#L25 assume !(~n <= 0); 937953#L26 call #t~ret0 := fact(~n - 1);< 938018#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 937991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937979#factFINAL assume true; 937879#factEXIT >#68#return; 937562#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 937777#factENTRY ~n := #in~n; 938294#L25 assume !(~n <= 0); 937854#L26 call #t~ret0 := fact(~n - 1);< 938014#factENTRY ~n := #in~n; 938109#L25 assume !(~n <= 0); 937945#L26 call #t~ret0 := fact(~n - 1);< 938018#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937871#factFINAL assume true; 937780#factEXIT >#70#return; 937847#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 938636#factENTRY ~n := #in~n; 938634#L25 assume !(~n <= 0); 937850#L26 call #t~ret0 := fact(~n - 1);< 937877#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938087#factFINAL assume true; 938071#factEXIT >#72#return; 938077#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; 938917#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 938916#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 938915#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 938914#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; 937885#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 937980#factENTRY ~n := #in~n; 943200#L25 assume !(~n <= 0); 937999#L26 call #t~ret0 := fact(~n - 1);< 938013#factENTRY ~n := #in~n; 938334#L25 assume !(~n <= 0); 937953#L26 call #t~ret0 := fact(~n - 1);< 938018#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 937991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937979#factFINAL assume true; 937879#factEXIT >#68#return; 937565#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 937777#factENTRY ~n := #in~n; 938294#L25 assume !(~n <= 0); 937854#L26 call #t~ret0 := fact(~n - 1);< 938014#factENTRY ~n := #in~n; 938109#L25 assume !(~n <= 0); 937945#L26 call #t~ret0 := fact(~n - 1);< 938018#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 937991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937979#factFINAL assume true; 937879#factEXIT >#70#return; 937935#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 938060#factENTRY ~n := #in~n; 938063#L25 assume ~n <= 0;#res := 1; 938062#factFINAL assume true; 938025#factEXIT >#72#return; 938059#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; 938355#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 938350#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 938348#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 938346#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; 938112#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 938122#factENTRY ~n := #in~n; 938121#L25 assume !(~n <= 0); 937954#L26 call #t~ret0 := fact(~n - 1);< 938107#factENTRY ~n := #in~n; 938022#L25 assume !(~n <= 0); 937961#L26 call #t~ret0 := fact(~n - 1);< 938020#factENTRY ~n := #in~n; 938022#L25 assume !(~n <= 0); 937961#L26 call #t~ret0 := fact(~n - 1);< 938020#factENTRY ~n := #in~n; 938022#L25 assume !(~n <= 0); 937961#L26 call #t~ret0 := fact(~n - 1);< 938020#factENTRY ~n := #in~n; 938022#L25 assume !(~n <= 0); 937961#L26 call #t~ret0 := fact(~n - 1);< 938020#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 938011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938587#factFINAL assume true; 938568#factEXIT >#66#return; 938567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938561#factFINAL assume true; 938494#factEXIT >#66#return; 938499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938384#factFINAL assume true; 938382#factEXIT >#74#return; 937888#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 937981#factENTRY ~n := #in~n; 938815#L25 assume !(~n <= 0); 938007#L26 call #t~ret0 := fact(~n - 1);< 938335#factENTRY ~n := #in~n; 938814#L25 assume !(~n <= 0); 937964#L26 call #t~ret0 := fact(~n - 1);< 937978#factENTRY ~n := #in~n; 938358#L25 assume !(~n <= 0); 938017#L26 call #t~ret0 := fact(~n - 1);< 938019#factENTRY ~n := #in~n; 938110#L25 assume ~n <= 0;#res := 1; 938105#factFINAL assume true; 938016#factEXIT >#66#return; 937993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937985#factFINAL assume true; 937944#factEXIT >#66#return; 937976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 938095#factFINAL assume true; 937997#factEXIT >#66#return; 937991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937979#factFINAL assume true; 937879#factEXIT >#76#return; 937569#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 937778#factENTRY ~n := #in~n; 938811#L25 assume !(~n <= 0); 937867#L26 call #t~ret0 := fact(~n - 1);< 937877#factENTRY ~n := #in~n; 937943#L25 assume ~n <= 0;#res := 1; 937875#factFINAL assume true; 937849#factEXIT >#66#return; 937779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 937776#factFINAL assume true; 937486#factEXIT >#78#return; 937764#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; 940029#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 940028#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 940027#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 940024#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; 939154#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 939204#factENTRY ~n := #in~n; 943073#L25 assume !(~n <= 0); 939356#L26 call #t~ret0 := fact(~n - 1);< 939460#factENTRY ~n := #in~n; 939496#L25 assume !(~n <= 0); 939371#L26 call #t~ret0 := fact(~n - 1);< 939495#factENTRY ~n := #in~n; 939496#L25 assume !(~n <= 0); 939371#L26 call #t~ret0 := fact(~n - 1);< 939495#factENTRY ~n := #in~n; 939496#L25 assume !(~n <= 0); 939371#L26 call #t~ret0 := fact(~n - 1);< 939495#factENTRY ~n := #in~n; 939496#L25 assume !(~n <= 0); 939371#L26 call #t~ret0 := fact(~n - 1);< 939495#factENTRY ~n := #in~n; 939555#L25 assume ~n <= 0;#res := 1; 939554#factFINAL assume true; 939491#factEXIT >#66#return; 939490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939479#factFINAL assume true; 939423#factEXIT >#66#return; 939439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940461#factFINAL assume true; 940445#factEXIT >#66#return; 940452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940632#factFINAL assume true; 940624#factEXIT >#66#return; 940627#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940414#factFINAL assume true; 940319#factEXIT >#66#return; 940322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939909#factFINAL assume true; 939693#factEXIT >#74#return; 939690#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 940019#factENTRY ~n := #in~n; 943075#L25 assume !(~n <= 0); 940560#L26 call #t~ret0 := fact(~n - 1);< 940578#factENTRY ~n := #in~n; 940921#L25 assume !(~n <= 0); 940645#L26 call #t~ret0 := fact(~n - 1);< 940659#factENTRY ~n := #in~n; 940201#L25 assume !(~n <= 0); 940688#L26 call #t~ret0 := fact(~n - 1);< 940694#factENTRY ~n := #in~n; 940667#L25 assume ~n <= 0;#res := 1; 940806#factFINAL assume true; 940687#factEXIT >#66#return; 940683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940676#factFINAL assume true; 940643#factEXIT >#66#return; 940642#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940581#factFINAL assume true; 940559#factEXIT >#66#return; 940569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940017#factFINAL assume true; 940018#factEXIT >#76#return; 939995#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 940008#factENTRY ~n := #in~n; 942983#L25 assume !(~n <= 0); 940646#L26 call #t~ret0 := fact(~n - 1);< 940659#factENTRY ~n := #in~n; 940201#L25 assume !(~n <= 0); 940688#L26 call #t~ret0 := fact(~n - 1);< 940694#factENTRY ~n := #in~n; 940667#L25 assume ~n <= 0;#res := 1; 940806#factFINAL assume true; 940687#factEXIT >#66#return; 940683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940676#factFINAL assume true; 940643#factEXIT >#66#return; 940654#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 942982#factFINAL assume true; 939994#factEXIT >#78#return; 939770#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; 940300#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 940299#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 940298#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 940297#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; 939580#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 939618#factENTRY ~n := #in~n; 942993#L25 assume !(~n <= 0); 938987#L26 call #t~ret0 := fact(~n - 1);< 939751#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939551#L25 assume !(~n <= 0); 939000#L26 call #t~ret0 := fact(~n - 1);< 939520#factENTRY ~n := #in~n; 939550#L25 assume ~n <= 0;#res := 1; 939548#factFINAL assume true; 939513#factEXIT >#66#return; 939511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939499#factFINAL assume true; 939309#factEXIT >#66#return; 939308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939106#factFINAL assume true; 939059#factEXIT >#66#return; 939071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939288#factFINAL assume true; 939279#factEXIT >#66#return; 939278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939037#factFINAL assume true; 939020#factEXIT >#66#return; 939019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939014#factFINAL assume true; 938979#factEXIT >#66#return; 939009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 940809#factFINAL assume true; 940684#factEXIT >#66#return; 940685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 941516#factFINAL assume true; 939906#factEXIT >#66#return; 939907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939919#factFINAL assume true; 939893#factEXIT >#66#return; 939891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939888#factFINAL assume true; 939885#factEXIT >#66#return; 939884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939883#factFINAL assume true; 939624#factEXIT >#74#return; 939589#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 935753#factENTRY ~n := #in~n; 941598#L25 assume !(~n <= 0); 939060#L26 call #t~ret0 := fact(~n - 1);< 939109#factENTRY ~n := #in~n; 940296#L25 assume !(~n <= 0); 939313#L26 call #t~ret0 := fact(~n - 1);< 939323#factENTRY ~n := #in~n; 939525#L25 assume !(~n <= 0); 939514#L26 call #t~ret0 := fact(~n - 1);< 939516#factENTRY ~n := #in~n; 939550#L25 assume ~n <= 0;#res := 1; 939548#factFINAL assume true; 939513#factEXIT >#66#return; 939511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939499#factFINAL assume true; 939309#factEXIT >#66#return; 939308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 939106#factFINAL assume true; 939059#factEXIT >#66#return; 939072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 941596#factFINAL assume true; 939715#factEXIT >#76#return; 935683#L30-7 [2022-11-18 20:36:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash 317657052, now seen corresponding path program 61 times [2022-11-18 20:36:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:41,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414544526] [2022-11-18 20:36:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:41,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:41,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358152011] [2022-11-18 20:36:41,786 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:36:41,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:41,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:41,788 INFO L229 MonitoredProcess]: Starting monitored process 333 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:41,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (333)] Waiting until timeout for monitored process [2022-11-18 20:36:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:44,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 2050 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:36:44,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 55061 backedges. 19447 proven. 83 refuted. 0 times theorem prover too weak. 35531 trivial. 0 not checked. [2022-11-18 20:36:44,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 55061 backedges. 855 proven. 2659 refuted. 0 times theorem prover too weak. 51547 trivial. 0 not checked. [2022-11-18 20:36:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414544526] [2022-11-18 20:36:46,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358152011] [2022-11-18 20:36:46,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358152011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:46,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:46,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 19 [2022-11-18 20:36:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330625470] [2022-11-18 20:36:46,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:46,662 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:36:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -429649871, now seen corresponding path program 45 times [2022-11-18 20:36:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:46,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139804656] [2022-11-18 20:36:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:46,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:46,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299191947] [2022-11-18 20:36:46,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:36:46,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:46,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:46,712 INFO L229 MonitoredProcess]: Starting monitored process 334 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:46,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (334)] Waiting until timeout for monitored process [2022-11-18 20:36:48,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-11-18 20:36:48,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:48,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 20:36:48,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18427 backedges. 5886 proven. 408 refuted. 0 times theorem prover too weak. 12133 trivial. 0 not checked. [2022-11-18 20:36:49,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18427 backedges. 4224 proven. 741 refuted. 0 times theorem prover too weak. 13462 trivial. 0 not checked. [2022-11-18 20:36:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:53,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139804656] [2022-11-18 20:36:53,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:36:53,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299191947] [2022-11-18 20:36:53,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299191947] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:53,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:53,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 31] total 37 [2022-11-18 20:36:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271615589] [2022-11-18 20:36:53,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:53,973 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:36:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-18 20:36:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 20:36:53,974 INFO L87 Difference]: Start difference. First operand 7582 states and 15962 transitions. cyclomatic complexity: 8448 Second operand has 37 states, 31 states have (on average 2.774193548387097) internal successors, (86), 35 states have internal predecessors, (86), 21 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (39), 19 states have call predecessors, (39), 21 states have call successors, (39) [2022-11-18 20:36:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:59,152 INFO L93 Difference]: Finished difference Result 10443 states and 21717 transitions. [2022-11-18 20:36:59,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10443 states and 21717 transitions. [2022-11-18 20:36:59,277 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 2713 [2022-11-18 20:36:59,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10443 states to 9932 states and 20809 transitions. [2022-11-18 20:36:59,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3718 [2022-11-18 20:36:59,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3718 [2022-11-18 20:36:59,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9932 states and 20809 transitions. [2022-11-18 20:36:59,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:36:59,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9932 states and 20809 transitions. [2022-11-18 20:36:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states and 20809 transitions. [2022-11-18 20:36:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 7817. [2022-11-18 20:36:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7817 states, 4516 states have (on average 1.046501328609389) internal successors, (4726), 4496 states have internal predecessors, (4726), 2541 states have call successors, (2642), 1009 states have call predecessors, (2642), 760 states have return successors, (9047), 2311 states have call predecessors, (9047), 2541 states have call successors, (9047) [2022-11-18 20:36:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 16415 transitions. [2022-11-18 20:36:59,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7817 states and 16415 transitions. [2022-11-18 20:36:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-18 20:36:59,740 INFO L428 stractBuchiCegarLoop]: Abstraction has 7817 states and 16415 transitions. [2022-11-18 20:36:59,740 INFO L335 stractBuchiCegarLoop]: ======== Iteration 78 ============ [2022-11-18 20:36:59,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7817 states and 16415 transitions. [2022-11-18 20:36:59,778 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1442 [2022-11-18 20:36:59,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:36:59,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:36:59,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [129, 129, 81, 81, 81, 81, 48, 16, 15, 10, 10, 10, 10, 10, 10, 10, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:36:59,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [76, 76, 55, 55, 55, 55, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:36:59,783 INFO L748 eck$LassoCheckResult]: Stem: 962612#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 962587#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; 962588#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 962611#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; 962640#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 962651#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 962649#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; 962647#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 962648#factENTRY ~n := #in~n; 962656#L25 assume ~n <= 0;#res := 1; 962654#factFINAL assume true; 962646#factEXIT >#68#return; 962633#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 962634#factENTRY ~n := #in~n; 962652#L25 assume ~n <= 0;#res := 1; 962650#factFINAL assume true; 962645#factEXIT >#70#return; 962561#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 962562#factENTRY ~n := #in~n; 962776#L25 assume ~n <= 0;#res := 1; 962664#factFINAL assume true; 962660#factEXIT >#72#return; 962605#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; 962606#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 962608#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 963508#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 963504#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; 963493#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 963494#factENTRY ~n := #in~n; 963510#L25 assume !(~n <= 0); 963502#L26 call #t~ret0 := fact(~n - 1);< 963503#factENTRY ~n := #in~n; 963511#L25 assume ~n <= 0;#res := 1; 963507#factFINAL assume true; 963501#factEXIT >#66#return; 963500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963499#factFINAL assume true; 963492#factEXIT >#74#return; 963488#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 963489#factENTRY ~n := #in~n; 963498#L25 assume ~n <= 0;#res := 1; 963491#factFINAL assume true; 963487#factEXIT >#76#return; 963483#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 963484#factENTRY ~n := #in~n; 963506#L25 assume !(~n <= 0); 963496#L26 call #t~ret0 := fact(~n - 1);< 963497#factENTRY ~n := #in~n; 963509#L25 assume ~n <= 0;#res := 1; 963505#factFINAL assume true; 963495#factEXIT >#66#return; 963490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963486#factFINAL assume true; 963482#factEXIT >#78#return; 963479#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; 963477#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 963475#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 963474#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 963472#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; 963462#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 963463#factENTRY ~n := #in~n; 963473#L25 assume !(~n <= 0); 963469#L26 call #t~ret0 := fact(~n - 1);< 963471#factENTRY ~n := #in~n; 963485#L25 assume !(~n <= 0); 963470#L26 call #t~ret0 := fact(~n - 1);< 963481#factENTRY ~n := #in~n; 963514#L25 assume ~n <= 0;#res := 1; 963513#factFINAL assume true; 963480#factEXIT >#66#return; 963478#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963476#factFINAL assume true; 963468#factEXIT >#66#return; 963466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963464#factFINAL assume true; 963461#factEXIT >#74#return; 963458#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 963459#factENTRY ~n := #in~n; 963467#L25 assume ~n <= 0;#res := 1; 963465#factFINAL assume true; 963457#factEXIT >#76#return; 963449#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 963454#factENTRY ~n := #in~n; 963451#L25 assume !(~n <= 0); 963435#L26 call #t~ret0 := fact(~n - 1);< 963441#factENTRY ~n := #in~n; 963460#L25 assume !(~n <= 0); 963434#L26 call #t~ret0 := fact(~n - 1);< 963453#factENTRY ~n := #in~n; 963456#L25 assume ~n <= 0;#res := 1; 963455#factFINAL assume true; 963452#factEXIT >#66#return; 963450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963448#factFINAL assume true; 963446#factEXIT >#66#return; 963447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963931#factFINAL assume true; 963930#factEXIT >#78#return; 963929#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; 963928#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 963927#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 963926#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 963925#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; 963425#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 963426#factENTRY ~n := #in~n; 963444#L25 assume !(~n <= 0); 963432#L26 call #t~ret0 := fact(~n - 1);< 963441#factENTRY ~n := #in~n; 963460#L25 assume !(~n <= 0); 963434#L26 call #t~ret0 := fact(~n - 1);< 963453#factENTRY ~n := #in~n; 963460#L25 assume !(~n <= 0); 963434#L26 call #t~ret0 := fact(~n - 1);< 963453#factENTRY ~n := #in~n; 963456#L25 assume ~n <= 0;#res := 1; 963455#factFINAL assume true; 963452#factEXIT >#66#return; 963450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963448#factFINAL assume true; 963446#factEXIT >#66#return; 963445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963442#factFINAL assume true; 963430#factEXIT >#66#return; 963429#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963428#factFINAL assume true; 963422#factEXIT >#74#return; 963417#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 963420#factENTRY ~n := #in~n; 963427#L25 assume ~n <= 0;#res := 1; 963421#factFINAL assume true; 963416#factEXIT >#76#return; 963414#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 963415#factENTRY ~n := #in~n; 963640#L25 assume !(~n <= 0); 963596#L26 call #t~ret0 := fact(~n - 1);< 963619#factENTRY ~n := #in~n; 963635#L25 assume !(~n <= 0); 963599#L26 call #t~ret0 := fact(~n - 1);< 963607#factENTRY ~n := #in~n; 963633#L25 assume !(~n <= 0); 963595#L26 call #t~ret0 := fact(~n - 1);< 963631#factENTRY ~n := #in~n; 963634#L25 assume ~n <= 0;#res := 1; 963632#factFINAL assume true; 963630#factEXIT >#66#return; 963629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963628#factFINAL assume true; 963626#factEXIT >#66#return; 963623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963622#factFINAL assume true; 963615#factEXIT >#66#return; 963605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964254#factFINAL assume true; 963413#factEXIT >#78#return; 963412#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; 963411#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 963409#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 963404#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 963069#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; 962994#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 962999#factENTRY ~n := #in~n; 962996#L25 assume !(~n <= 0); 962829#L26 call #t~ret0 := fact(~n - 1);< 962995#factENTRY ~n := #in~n; 962942#L25 assume !(~n <= 0); 962830#L26 call #t~ret0 := fact(~n - 1);< 962879#factENTRY ~n := #in~n; 962942#L25 assume !(~n <= 0); 962830#L26 call #t~ret0 := fact(~n - 1);< 962879#factENTRY ~n := #in~n; 962942#L25 assume !(~n <= 0); 962830#L26 call #t~ret0 := fact(~n - 1);< 962879#factENTRY ~n := #in~n; 962938#L25 assume ~n <= 0;#res := 1; 962936#factFINAL assume true; 962934#factEXIT >#66#return; 962930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 962880#factFINAL assume true; 962881#factEXIT >#66#return; 962872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 962873#factFINAL assume true; 962846#factEXIT >#66#return; 962847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 962993#factFINAL assume true; 962845#factEXIT >#66#return; 962831#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963061#factFINAL assume true; 963058#factEXIT >#74#return; 963015#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 963016#factENTRY ~n := #in~n; 963018#L25 assume ~n <= 0;#res := 1; 963017#factFINAL assume true; 963013#factEXIT >#76#return; 963002#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 963160#factENTRY ~n := #in~n; 963001#L25 assume !(~n <= 0); 962862#L26 call #t~ret0 := fact(~n - 1);< 962969#factENTRY ~n := #in~n; 962991#L25 assume !(~n <= 0); 962859#L26 call #t~ret0 := fact(~n - 1);< 962921#factENTRY ~n := #in~n; 962990#L25 assume !(~n <= 0); 962857#L26 call #t~ret0 := fact(~n - 1);< 962986#factENTRY ~n := #in~n; 962989#L25 assume ~n <= 0;#res := 1; 962988#factFINAL assume true; 962985#factEXIT >#66#return; 962982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 962979#factFINAL assume true; 962974#factEXIT >#66#return; 962972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 962970#factFINAL assume true; 962967#factEXIT >#66#return; 962968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 963343#factFINAL assume true; 963152#factEXIT >#78#return; 962808#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; 962807#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 962806#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 962805#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 962804#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 962803#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 962802#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 962790#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; 962780#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 962781#factENTRY ~n := #in~n; 962799#L25 assume !(~n <= 0); 962796#L26 call #t~ret0 := fact(~n - 1);< 962797#factENTRY ~n := #in~n; 962800#L25 assume ~n <= 0;#res := 1; 962798#factFINAL assume true; 962795#factEXIT >#66#return; 962792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 962789#factFINAL assume true; 962779#factEXIT >#68#return; 962682#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 962775#factENTRY ~n := #in~n; 962788#L25 assume ~n <= 0;#res := 1; 962778#factFINAL assume true; 962666#factEXIT >#70#return; 962662#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 962663#factENTRY ~n := #in~n; 962787#L25 assume !(~n <= 0); 962784#L26 call #t~ret0 := fact(~n - 1);< 962786#factENTRY ~n := #in~n; 962793#L25 assume ~n <= 0;#res := 1; 962791#factFINAL assume true; 962782#factEXIT >#66#return; 962777#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 962665#factFINAL assume true; 962661#factEXIT >#72#return; 962659#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; 962658#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 962657#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 962655#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 962653#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; 962575#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 962576#factENTRY ~n := #in~n; 962794#L25 assume !(~n <= 0); 962783#L26 call #t~ret0 := fact(~n - 1);< 962786#factENTRY ~n := #in~n; 962793#L25 assume ~n <= 0;#res := 1; 962791#factFINAL assume true; 962782#factEXIT >#66#return; 962785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965142#factFINAL assume true; 965140#factEXIT >#68#return; 964835#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 965040#factENTRY ~n := #in~n; 965183#L25 assume !(~n <= 0); 964821#L26 call #t~ret0 := fact(~n - 1);< 964834#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965125#factFINAL assume true; 965039#factEXIT >#70#return; 964389#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965019#factENTRY ~n := #in~n; 965164#L25 assume ~n <= 0;#res := 1; 965161#factFINAL assume true; 964388#factEXIT >#72#return; 964390#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; 965014#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 965011#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965008#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965005#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; 964948#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 965003#factENTRY ~n := #in~n; 965218#L25 assume !(~n <= 0); 964760#L26 call #t~ret0 := fact(~n - 1);< 965188#factENTRY ~n := #in~n; 965185#L25 assume !(~n <= 0); 964756#L26 call #t~ret0 := fact(~n - 1);< 965178#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965001#factFINAL assume true; 964947#factEXIT >#74#return; 964952#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 965130#factENTRY ~n := #in~n; 965630#L25 assume !(~n <= 0); 964819#L26 call #t~ret0 := fact(~n - 1);< 964827#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965129#factFINAL assume true; 965042#factEXIT >#76#return; 965043#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965130#factENTRY ~n := #in~n; 965630#L25 assume !(~n <= 0); 964819#L26 call #t~ret0 := fact(~n - 1);< 964827#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965129#factFINAL assume true; 965042#factEXIT >#78#return; 965053#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; 968601#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 968600#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 968599#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 968598#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; 968018#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 968026#factENTRY ~n := #in~n; 968050#L25 assume !(~n <= 0); 968044#L26 call #t~ret0 := fact(~n - 1);< 968049#factENTRY ~n := #in~n; 968573#L25 assume !(~n <= 0); 968042#L26 call #t~ret0 := fact(~n - 1);< 968128#factENTRY ~n := #in~n; 968573#L25 assume !(~n <= 0); 968042#L26 call #t~ret0 := fact(~n - 1);< 968128#factENTRY ~n := #in~n; 968194#L25 assume ~n <= 0;#res := 1; 968192#factFINAL assume true; 968124#factEXIT >#66#return; 968111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968085#factFINAL assume true; 968057#factEXIT >#66#return; 968056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968051#factFINAL assume true; 968031#factEXIT >#66#return; 968029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968028#factFINAL assume true; 968017#factEXIT >#74#return; 967894#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 967896#factENTRY ~n := #in~n; 968016#L25 assume !(~n <= 0); 967253#L26 call #t~ret0 := fact(~n - 1);< 967469#factENTRY ~n := #in~n; 967694#L25 assume ~n <= 0;#res := 1; 967674#factFINAL assume true; 967669#factEXIT >#66#return; 967672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968160#factFINAL assume true; 967899#factEXIT >#76#return; 967864#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 967869#factENTRY ~n := #in~n; 967940#L25 assume !(~n <= 0); 967248#L26 call #t~ret0 := fact(~n - 1);< 967264#factENTRY ~n := #in~n; 967623#L25 assume !(~n <= 0); 967420#L26 call #t~ret0 := fact(~n - 1);< 967425#factENTRY ~n := #in~n; 967555#L25 assume ~n <= 0;#res := 1; 967618#factFINAL assume true; 967419#factEXIT >#66#return; 967285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967268#factFINAL assume true; 967244#factEXIT >#66#return; 967256#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967886#factFINAL assume true; 967862#factEXIT >#78#return; 967856#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; 967857#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 967852#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 967853#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 967704#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; 967566#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 969423#factENTRY ~n := #in~n; 969357#L25 assume !(~n <= 0); 969331#L26 call #t~ret0 := fact(~n - 1);< 969338#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 962621#L25 assume ~n <= 0;#res := 1; 962623#factFINAL assume true; 969535#factEXIT >#66#return; 969533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969532#factFINAL assume true; 969531#factEXIT >#66#return; 969529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969517#factFINAL assume true; 969514#factEXIT >#66#return; 969513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969512#factFINAL assume true; 969511#factEXIT >#66#return; 969509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969508#factFINAL assume true; 969507#factEXIT >#66#return; 969506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969480#factFINAL assume true; 969431#factEXIT >#66#return; 969430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969427#factFINAL assume true; 969422#factEXIT >#74#return; 966394#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 968574#factENTRY ~n := #in~n; 968575#L25 assume !(~n <= 0); 966150#L26 call #t~ret0 := fact(~n - 1);< 966200#factENTRY ~n := #in~n; 966396#L25 assume ~n <= 0;#res := 1; 966393#factFINAL assume true; 966384#factEXIT >#66#return; 966386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969996#factFINAL assume true; 969990#factEXIT >#76#return; 966345#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 966348#factENTRY ~n := #in~n; 966347#L25 assume !(~n <= 0); 966184#L26 call #t~ret0 := fact(~n - 1);< 966339#factENTRY ~n := #in~n; 966374#L25 assume !(~n <= 0); 966120#L26 call #t~ret0 := fact(~n - 1);< 966205#factENTRY ~n := #in~n; 967143#L25 assume !(~n <= 0); 966119#L26 call #t~ret0 := fact(~n - 1);< 966166#factENTRY ~n := #in~n; 966259#L25 assume !(~n <= 0); 966152#L26 call #t~ret0 := fact(~n - 1);< 966217#factENTRY ~n := #in~n; 966280#L25 assume ~n <= 0;#res := 1; 966253#factFINAL assume true; 966212#factEXIT >#66#return; 966207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966194#factFINAL assume true; 966147#factEXIT >#66#return; 966145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966143#factFINAL assume true; 966098#factEXIT >#66#return; 966126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966203#factFINAL assume true; 966179#factEXIT >#66#return; 966188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968820#factFINAL assume true; 968754#factEXIT >#78#return; 965686#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; 965685#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 965684#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965683#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 965681#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 965678#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 965675#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965156#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; 965133#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 965134#factENTRY ~n := #in~n; 965151#L25 assume !(~n <= 0); 965145#L26 call #t~ret0 := fact(~n - 1);< 965150#factENTRY ~n := #in~n; 962801#L25 assume !(~n <= 0); 965147#L26 call #t~ret0 := fact(~n - 1);< 965158#factENTRY ~n := #in~n; 965296#L25 assume ~n <= 0;#res := 1; 965159#factFINAL assume true; 965157#factEXIT >#66#return; 965155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965152#factFINAL assume true; 965144#factEXIT >#66#return; 965143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965141#factFINAL assume true; 965132#factEXIT >#68#return; 962667#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 962775#factENTRY ~n := #in~n; 962788#L25 assume ~n <= 0;#res := 1; 962778#factFINAL assume true; 962666#factEXIT >#70#return; 962725#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965038#factENTRY ~n := #in~n; 965131#L25 assume !(~n <= 0); 964919#L26 call #t~ret0 := fact(~n - 1);< 965124#factENTRY ~n := #in~n; 965631#L25 assume !(~n <= 0); 964922#L26 call #t~ret0 := fact(~n - 1);< 965179#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964927#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965123#factFINAL assume true; 965037#factEXIT >#72#return; 965018#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; 965016#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 965013#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965010#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965007#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; 964944#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 965002#factENTRY ~n := #in~n; 965193#L25 assume !(~n <= 0); 964925#L26 call #t~ret0 := fact(~n - 1);< 964930#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965001#factFINAL assume true; 964947#factEXIT >#68#return; 964950#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 964999#factENTRY ~n := #in~n; 965139#L25 assume !(~n <= 0); 964820#L26 call #t~ret0 := fact(~n - 1);< 964834#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965129#factFINAL assume true; 965042#factEXIT >#70#return; 965021#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965036#factENTRY ~n := #in~n; 965138#L25 assume !(~n <= 0); 964823#L26 call #t~ret0 := fact(~n - 1);< 964827#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965041#factFINAL assume true; 965020#factEXIT >#72#return; 965017#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; 965015#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 965012#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965009#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965006#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; 964945#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 965002#factENTRY ~n := #in~n; 965193#L25 assume !(~n <= 0); 964925#L26 call #t~ret0 := fact(~n - 1);< 964930#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965001#factFINAL assume true; 964947#factEXIT >#68#return; 964949#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 964999#factENTRY ~n := #in~n; 965139#L25 assume !(~n <= 0); 964820#L26 call #t~ret0 := fact(~n - 1);< 964834#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965001#factFINAL assume true; 964947#factEXIT >#70#return; 964421#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 964392#factENTRY ~n := #in~n; 964437#L25 assume ~n <= 0;#res := 1; 964393#factFINAL assume true; 964436#factEXIT >#72#return; 964917#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; 964915#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 964911#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 964899#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 964897#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; 964850#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 964893#factENTRY ~n := #in~n; 965214#L25 assume !(~n <= 0); 964757#L26 call #t~ret0 := fact(~n - 1);< 965188#factENTRY ~n := #in~n; 965185#L25 assume !(~n <= 0); 964756#L26 call #t~ret0 := fact(~n - 1);< 965178#factENTRY ~n := #in~n; 965185#L25 assume !(~n <= 0); 964756#L26 call #t~ret0 := fact(~n - 1);< 965178#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964894#factFINAL assume true; 964845#factEXIT >#74#return; 964843#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 964844#factENTRY ~n := #in~n; 965184#L25 assume !(~n <= 0); 964818#L26 call #t~ret0 := fact(~n - 1);< 964834#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965001#factFINAL assume true; 964947#factEXIT >#76#return; 964828#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965608#factENTRY ~n := #in~n; 965637#L25 assume !(~n <= 0); 964824#L26 call #t~ret0 := fact(~n - 1);< 964834#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965129#factFINAL assume true; 965042#factEXIT >#78#return; 965052#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; 968156#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 968157#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 968559#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 968557#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; 968020#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 968026#factENTRY ~n := #in~n; 968050#L25 assume !(~n <= 0); 968044#L26 call #t~ret0 := fact(~n - 1);< 968049#factENTRY ~n := #in~n; 968573#L25 assume !(~n <= 0); 968042#L26 call #t~ret0 := fact(~n - 1);< 968128#factENTRY ~n := #in~n; 968573#L25 assume !(~n <= 0); 968042#L26 call #t~ret0 := fact(~n - 1);< 968128#factENTRY ~n := #in~n; 968194#L25 assume ~n <= 0;#res := 1; 968192#factFINAL assume true; 968124#factEXIT >#66#return; 968111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968085#factFINAL assume true; 968057#factEXIT >#66#return; 968056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968051#factFINAL assume true; 968031#factEXIT >#66#return; 968029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968028#factFINAL assume true; 968017#factEXIT >#74#return; 967893#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 967896#factENTRY ~n := #in~n; 968016#L25 assume !(~n <= 0); 967253#L26 call #t~ret0 := fact(~n - 1);< 967469#factENTRY ~n := #in~n; 967623#L25 assume !(~n <= 0); 967420#L26 call #t~ret0 := fact(~n - 1);< 967425#factENTRY ~n := #in~n; 967555#L25 assume ~n <= 0;#res := 1; 967618#factFINAL assume true; 967419#factEXIT >#66#return; 967285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967268#factFINAL assume true; 967244#factEXIT >#66#return; 967262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967989#factFINAL assume true; 967892#factEXIT >#76#return; 967863#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 967869#factENTRY ~n := #in~n; 967940#L25 assume !(~n <= 0); 967248#L26 call #t~ret0 := fact(~n - 1);< 967264#factENTRY ~n := #in~n; 967623#L25 assume !(~n <= 0); 967420#L26 call #t~ret0 := fact(~n - 1);< 967425#factENTRY ~n := #in~n; 967555#L25 assume ~n <= 0;#res := 1; 967618#factFINAL assume true; 967419#factEXIT >#66#return; 967285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967268#factFINAL assume true; 967244#factEXIT >#66#return; 967256#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967886#factFINAL assume true; 967862#factEXIT >#78#return; 967865#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; 968766#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 968653#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 968640#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 968638#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; 967468#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 969423#factENTRY ~n := #in~n; 969357#L25 assume !(~n <= 0); 969331#L26 call #t~ret0 := fact(~n - 1);< 969338#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 962621#L25 assume ~n <= 0;#res := 1; 962623#factFINAL assume true; 969535#factEXIT >#66#return; 969533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969532#factFINAL assume true; 969531#factEXIT >#66#return; 969529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969517#factFINAL assume true; 969514#factEXIT >#66#return; 969513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969512#factFINAL assume true; 969511#factEXIT >#66#return; 969509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969508#factFINAL assume true; 969507#factEXIT >#66#return; 969506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969480#factFINAL assume true; 969431#factEXIT >#66#return; 969430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969427#factFINAL assume true; 969422#factEXIT >#74#return; 966395#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 968574#factENTRY ~n := #in~n; 968575#L25 assume !(~n <= 0); 966150#L26 call #t~ret0 := fact(~n - 1);< 966200#factENTRY ~n := #in~n; 966262#L25 assume !(~n <= 0); 966213#L26 call #t~ret0 := fact(~n - 1);< 966218#factENTRY ~n := #in~n; 966280#L25 assume ~n <= 0;#res := 1; 966253#factFINAL assume true; 966212#factEXIT >#66#return; 966207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966194#factFINAL assume true; 966147#factEXIT >#66#return; 966160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969997#factFINAL assume true; 969985#factEXIT >#76#return; 966344#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 966348#factENTRY ~n := #in~n; 966347#L25 assume !(~n <= 0); 966184#L26 call #t~ret0 := fact(~n - 1);< 966339#factENTRY ~n := #in~n; 966374#L25 assume !(~n <= 0); 966120#L26 call #t~ret0 := fact(~n - 1);< 966205#factENTRY ~n := #in~n; 967143#L25 assume !(~n <= 0); 966119#L26 call #t~ret0 := fact(~n - 1);< 966166#factENTRY ~n := #in~n; 966259#L25 assume !(~n <= 0); 966152#L26 call #t~ret0 := fact(~n - 1);< 966217#factENTRY ~n := #in~n; 966280#L25 assume ~n <= 0;#res := 1; 966253#factFINAL assume true; 966212#factEXIT >#66#return; 966207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966194#factFINAL assume true; 966147#factEXIT >#66#return; 966145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966143#factFINAL assume true; 966098#factEXIT >#66#return; 966126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966203#factFINAL assume true; 966179#factEXIT >#66#return; 966188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968820#factFINAL assume true; 968754#factEXIT >#78#return; 966002#L30-8 [2022-11-18 20:36:59,784 INFO L750 eck$LassoCheckResult]: Loop: 966002#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; 968751#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 965952#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965951#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 965949#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 965948#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 965931#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965932#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; 965336#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 965389#factENTRY ~n := #in~n; 965388#L25 assume !(~n <= 0); 965146#L26 call #t~ret0 := fact(~n - 1);< 965150#factENTRY ~n := #in~n; 962801#L25 assume !(~n <= 0); 965147#L26 call #t~ret0 := fact(~n - 1);< 965158#factENTRY ~n := #in~n; 962801#L25 assume !(~n <= 0); 965147#L26 call #t~ret0 := fact(~n - 1);< 965158#factENTRY ~n := #in~n; 965296#L25 assume ~n <= 0;#res := 1; 965159#factFINAL assume true; 965157#factEXIT >#66#return; 965155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965152#factFINAL assume true; 965144#factEXIT >#66#return; 965149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965597#factFINAL assume true; 965594#factEXIT >#66#return; 965592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965590#factFINAL assume true; 965588#factEXIT >#68#return; 962722#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 962775#factENTRY ~n := #in~n; 962788#L25 assume ~n <= 0;#res := 1; 962778#factFINAL assume true; 962666#factEXIT >#70#return; 962772#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965580#factENTRY ~n := #in~n; 965589#L25 assume !(~n <= 0); 964906#L26 call #t~ret0 := fact(~n - 1);< 964909#factENTRY ~n := #in~n; 965562#L25 assume !(~n <= 0); 964924#L26 call #t~ret0 := fact(~n - 1);< 964930#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965581#factFINAL assume true; 965577#factEXIT >#72#return; 965573#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; 965571#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 965572#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965568#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965566#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; 964848#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 964895#factENTRY ~n := #in~n; 965636#L25 assume !(~n <= 0); 964901#L26 call #t~ret0 := fact(~n - 1);< 965564#factENTRY ~n := #in~n; 965565#L25 assume !(~n <= 0); 964920#L26 call #t~ret0 := fact(~n - 1);< 965179#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964894#factFINAL assume true; 964845#factEXIT >#68#return; 964842#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 962632#factENTRY ~n := #in~n; 964836#L25 assume !(~n <= 0); 964822#L26 call #t~ret0 := fact(~n - 1);< 964910#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965129#factFINAL assume true; 965042#factEXIT >#70#return; 964942#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965137#factENTRY ~n := #in~n; 965127#L25 assume !(~n <= 0); 964921#L26 call #t~ret0 := fact(~n - 1);< 964930#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965558#factFINAL assume true; 965533#factEXIT >#72#return; 965529#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; 965525#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 965526#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965516#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965517#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; 964846#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 964895#factENTRY ~n := #in~n; 965636#L25 assume !(~n <= 0); 964901#L26 call #t~ret0 := fact(~n - 1);< 965564#factENTRY ~n := #in~n; 965565#L25 assume !(~n <= 0); 964920#L26 call #t~ret0 := fact(~n - 1);< 965179#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964894#factFINAL assume true; 964845#factEXIT >#68#return; 964840#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 962632#factENTRY ~n := #in~n; 964836#L25 assume !(~n <= 0); 964822#L26 call #t~ret0 := fact(~n - 1);< 964910#factENTRY ~n := #in~n; 965186#L25 assume !(~n <= 0); 964923#L26 call #t~ret0 := fact(~n - 1);< 965179#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965001#factFINAL assume true; 964947#factEXIT >#70#return; 964410#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965004#factENTRY ~n := #in~n; 965000#L25 assume !(~n <= 0); 964817#L26 call #t~ret0 := fact(~n - 1);< 964834#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965041#factFINAL assume true; 965020#factEXIT >#72#return; 965031#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; 965409#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 965410#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965405#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965406#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; 964849#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 964895#factENTRY ~n := #in~n; 965636#L25 assume !(~n <= 0); 964901#L26 call #t~ret0 := fact(~n - 1);< 965564#factENTRY ~n := #in~n; 965565#L25 assume !(~n <= 0); 964920#L26 call #t~ret0 := fact(~n - 1);< 965179#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964894#factFINAL assume true; 964845#factEXIT >#68#return; 964838#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 962632#factENTRY ~n := #in~n; 964836#L25 assume !(~n <= 0); 964822#L26 call #t~ret0 := fact(~n - 1);< 964910#factENTRY ~n := #in~n; 965186#L25 assume !(~n <= 0); 964923#L26 call #t~ret0 := fact(~n - 1);< 965179#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964894#factFINAL assume true; 964845#factEXIT >#70#return; 964428#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 964392#factENTRY ~n := #in~n; 964437#L25 assume ~n <= 0;#res := 1; 964393#factFINAL assume true; 964436#factEXIT >#72#return; 964931#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; 965642#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 965643#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 965638#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 965639#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; 964548#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 965211#factENTRY ~n := #in~n; 965209#L25 assume !(~n <= 0); 964799#L26 call #t~ret0 := fact(~n - 1);< 965188#factENTRY ~n := #in~n; 965185#L25 assume !(~n <= 0); 964756#L26 call #t~ret0 := fact(~n - 1);< 965178#factENTRY ~n := #in~n; 965185#L25 assume !(~n <= 0); 964756#L26 call #t~ret0 := fact(~n - 1);< 965178#factENTRY ~n := #in~n; 965185#L25 assume !(~n <= 0); 964756#L26 call #t~ret0 := fact(~n - 1);< 965178#factENTRY ~n := #in~n; 965185#L25 assume !(~n <= 0); 964756#L26 call #t~ret0 := fact(~n - 1);< 965178#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964812#factFINAL assume true; 964754#factEXIT >#66#return; 964807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965494#factFINAL assume true; 965480#factEXIT >#66#return; 965483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965616#factFINAL assume true; 965615#factEXIT >#74#return; 964709#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 964896#factENTRY ~n := #in~n; 965652#L25 assume !(~n <= 0); 964904#L26 call #t~ret0 := fact(~n - 1);< 964909#factENTRY ~n := #in~n; 965562#L25 assume !(~n <= 0); 964924#L26 call #t~ret0 := fact(~n - 1);< 964930#factENTRY ~n := #in~n; 965632#L25 assume !(~n <= 0); 965175#L26 call #t~ret0 := fact(~n - 1);< 965177#factENTRY ~n := #in~n; 965298#L25 assume ~n <= 0;#res := 1; 965297#factFINAL assume true; 965174#factEXIT >#66#return; 965172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964940#factFINAL assume true; 964918#factEXIT >#66#return; 964916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964912#factFINAL assume true; 964900#factEXIT >#66#return; 964898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 964894#factFINAL assume true; 964845#factEXIT >#76#return; 964832#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 965608#factENTRY ~n := #in~n; 965637#L25 assume !(~n <= 0); 964824#L26 call #t~ret0 := fact(~n - 1);< 964834#factENTRY ~n := #in~n; 964816#L25 assume ~n <= 0;#res := 1; 964825#factFINAL assume true; 965135#factEXIT >#66#return; 965136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 965129#factFINAL assume true; 965042#factEXIT >#78#return; 965111#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; 968208#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 968205#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 968202#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 968201#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; 966745#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 966787#factENTRY ~n := #in~n; 968161#L25 assume !(~n <= 0); 967327#L26 call #t~ret0 := fact(~n - 1);< 967644#factENTRY ~n := #in~n; 968083#L25 assume !(~n <= 0); 967309#L26 call #t~ret0 := fact(~n - 1);< 967681#factENTRY ~n := #in~n; 968083#L25 assume !(~n <= 0); 967309#L26 call #t~ret0 := fact(~n - 1);< 967681#factENTRY ~n := #in~n; 968083#L25 assume !(~n <= 0); 967309#L26 call #t~ret0 := fact(~n - 1);< 967681#factENTRY ~n := #in~n; 967696#L25 assume ~n <= 0;#res := 1; 967695#factFINAL assume true; 967679#factEXIT >#66#return; 967677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967656#factFINAL assume true; 967626#factEXIT >#66#return; 967625#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967428#factFINAL assume true; 967371#factEXIT >#66#return; 967364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967370#factFINAL assume true; 967386#factEXIT >#66#return; 967390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967287#factFINAL assume true; 967288#factEXIT >#74#return; 966783#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 968789#factENTRY ~n := #in~n; 969334#L25 assume !(~n <= 0); 967216#L26 call #t~ret0 := fact(~n - 1);< 967229#factENTRY ~n := #in~n; 968632#L25 assume !(~n <= 0); 967246#L26 call #t~ret0 := fact(~n - 1);< 967264#factENTRY ~n := #in~n; 967623#L25 assume !(~n <= 0); 967420#L26 call #t~ret0 := fact(~n - 1);< 967425#factENTRY ~n := #in~n; 967555#L25 assume ~n <= 0;#res := 1; 967618#factFINAL assume true; 967419#factEXIT >#66#return; 967285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967268#factFINAL assume true; 967244#factEXIT >#66#return; 967243#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967235#factFINAL assume true; 967213#factEXIT >#66#return; 967225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969954#factFINAL assume true; 969952#factEXIT >#76#return; 967270#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 967945#factENTRY ~n := #in~n; 968634#L25 assume !(~n <= 0); 967245#L26 call #t~ret0 := fact(~n - 1);< 967264#factENTRY ~n := #in~n; 967623#L25 assume !(~n <= 0); 967420#L26 call #t~ret0 := fact(~n - 1);< 967425#factENTRY ~n := #in~n; 967555#L25 assume ~n <= 0;#res := 1; 967618#factFINAL assume true; 967419#factEXIT >#66#return; 967285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967268#factFINAL assume true; 967244#factEXIT >#66#return; 967254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 967948#factFINAL assume true; 967941#factEXIT >#78#return; 967942#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; 967951#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 967949#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 967947#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 967946#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; 967397#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 969423#factENTRY ~n := #in~n; 969357#L25 assume !(~n <= 0); 969331#L26 call #t~ret0 := fact(~n - 1);< 969338#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 969329#L25 assume !(~n <= 0); 962622#L26 call #t~ret0 := fact(~n - 1);< 969328#factENTRY ~n := #in~n; 962621#L25 assume ~n <= 0;#res := 1; 962623#factFINAL assume true; 969535#factEXIT >#66#return; 969533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969532#factFINAL assume true; 969531#factEXIT >#66#return; 969529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969517#factFINAL assume true; 969514#factEXIT >#66#return; 969513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969512#factFINAL assume true; 969511#factEXIT >#66#return; 969509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969508#factFINAL assume true; 969507#factEXIT >#66#return; 969506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969480#factFINAL assume true; 969431#factEXIT >#66#return; 969430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969427#factFINAL assume true; 969422#factEXIT >#74#return; 969363#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 969365#factENTRY ~n := #in~n; 969510#L25 assume !(~n <= 0); 966124#L26 call #t~ret0 := fact(~n - 1);< 966133#factENTRY ~n := #in~n; 966222#L25 assume !(~n <= 0); 966148#L26 call #t~ret0 := fact(~n - 1);< 966168#factENTRY ~n := #in~n; 966262#L25 assume !(~n <= 0); 966213#L26 call #t~ret0 := fact(~n - 1);< 966218#factENTRY ~n := #in~n; 966280#L25 assume ~n <= 0;#res := 1; 966253#factFINAL assume true; 966212#factEXIT >#66#return; 966207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966194#factFINAL assume true; 966147#factEXIT >#66#return; 966145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966143#factFINAL assume true; 966098#factEXIT >#66#return; 966132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 969502#factFINAL assume true; 969362#factEXIT >#76#return; 966849#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 966860#factENTRY ~n := #in~n; 966847#L25 assume !(~n <= 0); 966111#L26 call #t~ret0 := fact(~n - 1);< 966340#factENTRY ~n := #in~n; 966363#L25 assume !(~n <= 0); 966105#L26 call #t~ret0 := fact(~n - 1);< 966204#factENTRY ~n := #in~n; 966254#L25 assume !(~n <= 0); 966099#L26 call #t~ret0 := fact(~n - 1);< 966214#factENTRY ~n := #in~n; 966259#L25 assume !(~n <= 0); 966152#L26 call #t~ret0 := fact(~n - 1);< 966217#factENTRY ~n := #in~n; 966280#L25 assume ~n <= 0;#res := 1; 966253#factFINAL assume true; 966212#factEXIT >#66#return; 966207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966194#factFINAL assume true; 966147#factEXIT >#66#return; 966145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966143#factFINAL assume true; 966098#factEXIT >#66#return; 966126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 966203#factFINAL assume true; 966179#factEXIT >#66#return; 966188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 968820#factFINAL assume true; 968754#factEXIT >#78#return; 966002#L30-8 [2022-11-18 20:36:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -370343517, now seen corresponding path program 62 times [2022-11-18 20:36:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524806055] [2022-11-18 20:36:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:59,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:36:59,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950095715] [2022-11-18 20:36:59,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:36:59,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:59,837 INFO L229 MonitoredProcess]: Starting monitored process 335 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:59,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (335)] Waiting until timeout for monitored process [2022-11-18 20:37:02,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:37:02,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:37:02,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:37:02,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 40168 backedges. 16072 proven. 24 refuted. 0 times theorem prover too weak. 24072 trivial. 0 not checked. [2022-11-18 20:37:02,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 40168 backedges. 796 proven. 1545 refuted. 0 times theorem prover too weak. 37827 trivial. 0 not checked. [2022-11-18 20:37:04,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:37:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524806055] [2022-11-18 20:37:04,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:37:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950095715] [2022-11-18 20:37:04,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950095715] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:04,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:04,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2022-11-18 20:37:04,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474549674] [2022-11-18 20:37:04,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:04,320 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:37:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1856495405, now seen corresponding path program 46 times [2022-11-18 20:37:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:37:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669317389] [2022-11-18 20:37:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:37:04,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:37:04,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397688669] [2022-11-18 20:37:04,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:37:04,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:37:04,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:37:04,375 INFO L229 MonitoredProcess]: Starting monitored process 336 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:37:04,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (336)] Waiting until timeout for monitored process [2022-11-18 20:37:06,805 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:37:06,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:37:06,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:37:06,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14485 backedges. 8087 proven. 65 refuted. 0 times theorem prover too weak. 6333 trivial. 0 not checked. [2022-11-18 20:37:07,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14485 backedges. 867 proven. 851 refuted. 0 times theorem prover too weak. 12767 trivial. 0 not checked. [2022-11-18 20:37:08,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:37:08,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669317389] [2022-11-18 20:37:08,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:37:08,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397688669] [2022-11-18 20:37:08,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397688669] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:08,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:08,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 19 [2022-11-18 20:37:08,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584051336] [2022-11-18 20:37:08,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:08,376 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-18 20:37:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:37:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:37:08,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:37:08,377 INFO L87 Difference]: Start difference. First operand 7817 states and 16415 transitions. cyclomatic complexity: 8666 Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 13 states have call successors, (27), 2 states have call predecessors, (27), 7 states have return successors, (30), 11 states have call predecessors, (30), 13 states have call successors, (30) [2022-11-18 20:37:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:09,546 INFO L93 Difference]: Finished difference Result 9226 states and 20701 transitions. [2022-11-18 20:37:09,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9226 states and 20701 transitions. [2022-11-18 20:37:09,830 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1768 [2022-11-18 20:37:09,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9226 states to 9210 states and 20675 transitions. [2022-11-18 20:37:09,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3701 [2022-11-18 20:37:09,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3701 [2022-11-18 20:37:09,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9210 states and 20675 transitions. [2022-11-18 20:37:09,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-18 20:37:09,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9210 states and 20675 transitions. [2022-11-18 20:37:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9210 states and 20675 transitions. [2022-11-18 20:37:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9210 to 7905. [2022-11-18 20:37:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7905 states, 4574 states have (on average 1.0465675557498906) internal successors, (4787), 4556 states have internal predecessors, (4787), 2567 states have call successors, (2670), 1009 states have call predecessors, (2670), 764 states have return successors, (9089), 2339 states have call predecessors, (9089), 2567 states have call successors, (9089) [2022-11-18 20:37:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7905 states to 7905 states and 16546 transitions. [2022-11-18 20:37:10,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7905 states and 16546 transitions. [2022-11-18 20:37:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:37:10,359 INFO L428 stractBuchiCegarLoop]: Abstraction has 7905 states and 16546 transitions. [2022-11-18 20:37:10,359 INFO L335 stractBuchiCegarLoop]: ======== Iteration 79 ============ [2022-11-18 20:37:10,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7905 states and 16546 transitions. [2022-11-18 20:37:10,406 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 1464 [2022-11-18 20:37:10,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-18 20:37:10,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-18 20:37:10,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [126, 126, 78, 78, 78, 78, 48, 16, 15, 10, 10, 10, 10, 10, 10, 10, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:37:10,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [75, 75, 54, 54, 54, 54, 21, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-18 20:37:10,411 INFO L748 eck$LassoCheckResult]: Stem: 987441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 987415#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; 987416#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 987440#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; 987471#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 987482#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 987480#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; 987478#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 987479#factENTRY ~n := #in~n; 987487#L25 assume ~n <= 0;#res := 1; 987485#factFINAL assume true; 987477#factEXIT >#68#return; 987462#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 987463#factENTRY ~n := #in~n; 987483#L25 assume ~n <= 0;#res := 1; 987481#factFINAL assume true; 987476#factEXIT >#70#return; 987372#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 987373#factENTRY ~n := #in~n; 987492#L25 assume ~n <= 0;#res := 1; 987491#factFINAL assume true; 987490#factEXIT >#72#return; 987489#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; 987434#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 987435#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 988525#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 988523#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; 988519#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 988520#factENTRY ~n := #in~n; 988530#L25 assume !(~n <= 0); 988527#L26 call #t~ret0 := fact(~n - 1);< 988528#factENTRY ~n := #in~n; 988531#L25 assume ~n <= 0;#res := 1; 988529#factFINAL assume true; 988526#factEXIT >#66#return; 988524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988522#factFINAL assume true; 988518#factEXIT >#74#return; 988504#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 988505#factENTRY ~n := #in~n; 988508#L25 assume ~n <= 0;#res := 1; 988507#factFINAL assume true; 988503#factEXIT >#76#return; 988500#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 988501#factENTRY ~n := #in~n; 988514#L25 assume !(~n <= 0); 988512#L26 call #t~ret0 := fact(~n - 1);< 988513#factENTRY ~n := #in~n; 988516#L25 assume ~n <= 0;#res := 1; 988515#factFINAL assume true; 988511#factEXIT >#66#return; 988510#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988509#factFINAL assume true; 988499#factEXIT >#78#return; 988495#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; 988493#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 988490#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 988485#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 988483#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; 988480#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 988481#factENTRY ~n := #in~n; 988492#L25 assume !(~n <= 0); 988487#L26 call #t~ret0 := fact(~n - 1);< 988489#factENTRY ~n := #in~n; 988498#L25 assume !(~n <= 0); 988488#L26 call #t~ret0 := fact(~n - 1);< 988497#factENTRY ~n := #in~n; 988506#L25 assume ~n <= 0;#res := 1; 988502#factFINAL assume true; 988496#factEXIT >#66#return; 988494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988491#factFINAL assume true; 988486#factEXIT >#66#return; 988484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988482#factFINAL assume true; 988479#factEXIT >#74#return; 988442#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 988443#factENTRY ~n := #in~n; 988477#L25 assume ~n <= 0;#res := 1; 988476#factFINAL assume true; 988441#factEXIT >#76#return; 988322#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 988323#factENTRY ~n := #in~n; 988333#L25 assume !(~n <= 0); 988307#L26 call #t~ret0 := fact(~n - 1);< 988312#factENTRY ~n := #in~n; 988341#L25 assume !(~n <= 0); 988305#L26 call #t~ret0 := fact(~n - 1);< 988338#factENTRY ~n := #in~n; 988340#L25 assume ~n <= 0;#res := 1; 988339#factFINAL assume true; 988337#factEXIT >#66#return; 988336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988335#factFINAL assume true; 988327#factEXIT >#66#return; 988326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988325#factFINAL assume true; 988321#factEXIT >#78#return; 988320#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; 988319#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 988317#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 988313#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 988300#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; 988294#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 988297#factENTRY ~n := #in~n; 988439#L25 assume !(~n <= 0); 988303#L26 call #t~ret0 := fact(~n - 1);< 988312#factENTRY ~n := #in~n; 988341#L25 assume !(~n <= 0); 988305#L26 call #t~ret0 := fact(~n - 1);< 988338#factENTRY ~n := #in~n; 988341#L25 assume !(~n <= 0); 988305#L26 call #t~ret0 := fact(~n - 1);< 988338#factENTRY ~n := #in~n; 988340#L25 assume ~n <= 0;#res := 1; 988339#factFINAL assume true; 988337#factEXIT >#66#return; 988336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988335#factFINAL assume true; 988327#factEXIT >#66#return; 988328#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988329#factFINAL assume true; 988301#factEXIT >#66#return; 988299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988298#factFINAL assume true; 988291#factEXIT >#74#return; 988296#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 988285#factENTRY ~n := #in~n; 988475#L25 assume ~n <= 0;#res := 1; 988440#factFINAL assume true; 988406#factEXIT >#76#return; 988281#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 988404#factENTRY ~n := #in~n; 988553#L25 assume !(~n <= 0); 988246#L26 call #t~ret0 := fact(~n - 1);< 988276#factENTRY ~n := #in~n; 988551#L25 assume !(~n <= 0); 988245#L26 call #t~ret0 := fact(~n - 1);< 988251#factENTRY ~n := #in~n; 988471#L25 assume !(~n <= 0); 988239#L26 call #t~ret0 := fact(~n - 1);< 988470#factENTRY ~n := #in~n; 988473#L25 assume ~n <= 0;#res := 1; 988472#factFINAL assume true; 988469#factEXIT >#66#return; 988468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988467#factFINAL assume true; 988438#factEXIT >#66#return; 988282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988279#factFINAL assume true; 988272#factEXIT >#66#return; 988250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 988607#factFINAL assume true; 988402#factEXIT >#78#return; 988403#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; 988558#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 988556#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 988555#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 988178#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; 987851#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 987863#factENTRY ~n := #in~n; 987861#L25 assume !(~n <= 0); 987674#L26 call #t~ret0 := fact(~n - 1);< 987853#factENTRY ~n := #in~n; 987773#L25 assume !(~n <= 0); 987673#L26 call #t~ret0 := fact(~n - 1);< 987712#factENTRY ~n := #in~n; 987773#L25 assume !(~n <= 0); 987673#L26 call #t~ret0 := fact(~n - 1);< 987712#factENTRY ~n := #in~n; 987773#L25 assume !(~n <= 0); 987673#L26 call #t~ret0 := fact(~n - 1);< 987712#factENTRY ~n := #in~n; 987769#L25 assume ~n <= 0;#res := 1; 987767#factFINAL assume true; 987765#factEXIT >#66#return; 987761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987713#factFINAL assume true; 987714#factEXIT >#66#return; 987705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987706#factFINAL assume true; 987680#factEXIT >#66#return; 987681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987850#factFINAL assume true; 987678#factEXIT >#66#return; 987679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 995268#factFINAL assume true; 995267#factEXIT >#74#return; 987826#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 987828#factENTRY ~n := #in~n; 987859#L25 assume ~n <= 0;#res := 1; 987849#factFINAL assume true; 987824#factEXIT >#76#return; 987827#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 987882#factENTRY ~n := #in~n; 987879#L25 assume !(~n <= 0); 987692#L26 call #t~ret0 := fact(~n - 1);< 987805#factENTRY ~n := #in~n; 987855#L25 assume !(~n <= 0); 987689#L26 call #t~ret0 := fact(~n - 1);< 987752#factENTRY ~n := #in~n; 987817#L25 assume !(~n <= 0); 987702#L26 call #t~ret0 := fact(~n - 1);< 987816#factENTRY ~n := #in~n; 987820#L25 assume ~n <= 0;#res := 1; 987818#factFINAL assume true; 987815#factEXIT >#66#return; 987814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987813#factFINAL assume true; 987809#factEXIT >#66#return; 987808#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987806#factFINAL assume true; 987803#factEXIT >#66#return; 987804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987944#factFINAL assume true; 987943#factEXIT >#78#return; 987643#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; 987642#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 987641#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 987640#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 987639#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 987638#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 987637#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 987626#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; 987616#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 987617#factENTRY ~n := #in~n; 987634#L25 assume !(~n <= 0); 987376#L26 call #t~ret0 := fact(~n - 1);< 987632#factENTRY ~n := #in~n; 987635#L25 assume ~n <= 0;#res := 1; 987633#factFINAL assume true; 987631#factEXIT >#66#return; 987628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987625#factFINAL assume true; 987615#factEXIT >#68#return; 987514#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 987612#factENTRY ~n := #in~n; 987623#L25 assume ~n <= 0;#res := 1; 987614#factFINAL assume true; 987497#factEXIT >#70#return; 987494#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 987495#factENTRY ~n := #in~n; 987624#L25 assume !(~n <= 0); 987619#L26 call #t~ret0 := fact(~n - 1);< 987622#factENTRY ~n := #in~n; 987629#L25 assume ~n <= 0;#res := 1; 987627#factFINAL assume true; 987618#factEXIT >#66#return; 987613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 987496#factFINAL assume true; 987493#factEXIT >#72#return; 987437#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; 987438#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 987488#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 987486#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 987484#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; 987402#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 987403#factENTRY ~n := #in~n; 987630#L25 assume !(~n <= 0); 987620#L26 call #t~ret0 := fact(~n - 1);< 987622#factENTRY ~n := #in~n; 987629#L25 assume ~n <= 0;#res := 1; 987627#factFINAL assume true; 987618#factEXIT >#66#return; 987621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989775#factFINAL assume true; 989773#factEXIT >#68#return; 989639#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989771#factENTRY ~n := #in~n; 989871#L25 assume !(~n <= 0); 989617#L26 call #t~ret0 := fact(~n - 1);< 989640#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989897#factFINAL assume true; 989770#factEXIT >#70#return; 989767#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 989768#factENTRY ~n := #in~n; 989896#L25 assume ~n <= 0;#res := 1; 989895#factFINAL assume true; 989766#factEXIT >#72#return; 989758#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; 989753#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 989678#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 989642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 989637#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; 989544#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989611#factENTRY ~n := #in~n; 989988#L25 assume !(~n <= 0); 989666#L26 call #t~ret0 := fact(~n - 1);< 989902#factENTRY ~n := #in~n; 989876#L25 assume !(~n <= 0); 989661#L26 call #t~ret0 := fact(~n - 1);< 989763#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989634#factFINAL assume true; 989541#factEXIT >#74#return; 989250#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989536#factENTRY ~n := #in~n; 990371#L25 assume !(~n <= 0); 989618#L26 call #t~ret0 := fact(~n - 1);< 989633#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989537#factFINAL assume true; 989240#factEXIT >#76#return; 989383#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 989536#factENTRY ~n := #in~n; 990371#L25 assume !(~n <= 0); 989618#L26 call #t~ret0 := fact(~n - 1);< 989633#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989537#factFINAL assume true; 989240#factEXIT >#78#return; 987417#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; 987418#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 993136#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 993134#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 993128#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; 993044#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 993049#factENTRY ~n := #in~n; 993074#L25 assume !(~n <= 0); 993056#L26 call #t~ret0 := fact(~n - 1);< 993071#factENTRY ~n := #in~n; 993519#L25 assume !(~n <= 0); 993055#L26 call #t~ret0 := fact(~n - 1);< 993131#factENTRY ~n := #in~n; 993519#L25 assume !(~n <= 0); 993055#L26 call #t~ret0 := fact(~n - 1);< 993131#factENTRY ~n := #in~n; 993515#L25 assume ~n <= 0;#res := 1; 993514#factFINAL assume true; 993129#factEXIT >#66#return; 993127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993115#factFINAL assume true; 993096#factEXIT >#66#return; 993095#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993089#factFINAL assume true; 993053#factEXIT >#66#return; 993052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993051#factFINAL assume true; 993039#factEXIT >#74#return; 993033#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 993037#factENTRY ~n := #in~n; 993092#L25 assume !(~n <= 0); 992546#L26 call #t~ret0 := fact(~n - 1);< 992569#factENTRY ~n := #in~n; 993512#L25 assume ~n <= 0;#res := 1; 993510#factFINAL assume true; 993084#factEXIT >#66#return; 993083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993082#factFINAL assume true; 993081#factEXIT >#76#return; 993025#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 993029#factENTRY ~n := #in~n; 993050#L25 assume !(~n <= 0); 992553#L26 call #t~ret0 := fact(~n - 1);< 992563#factENTRY ~n := #in~n; 992589#L25 assume !(~n <= 0); 992577#L26 call #t~ret0 := fact(~n - 1);< 992579#factENTRY ~n := #in~n; 992605#L25 assume ~n <= 0;#res := 1; 992603#factFINAL assume true; 992576#factEXIT >#66#return; 992575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992567#factFINAL assume true; 992545#factEXIT >#66#return; 992559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993031#factFINAL assume true; 993023#factEXIT >#78#return; 993027#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; 993080#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 993079#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 993078#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 993072#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; 990760#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 991804#factENTRY ~n := #in~n; 992299#L25 assume !(~n <= 0); 992149#L26 call #t~ret0 := fact(~n - 1);< 992153#factENTRY ~n := #in~n; 992238#L25 assume !(~n <= 0); 992150#L26 call #t~ret0 := fact(~n - 1);< 992218#factENTRY ~n := #in~n; 992238#L25 assume !(~n <= 0); 992150#L26 call #t~ret0 := fact(~n - 1);< 992218#factENTRY ~n := #in~n; 992238#L25 assume !(~n <= 0); 992150#L26 call #t~ret0 := fact(~n - 1);< 992218#factENTRY ~n := #in~n; 992236#L25 assume ~n <= 0;#res := 1; 992235#factFINAL assume true; 992233#factEXIT >#66#return; 992232#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992231#factFINAL assume true; 992228#factEXIT >#66#return; 992227#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992226#factFINAL assume true; 992223#factEXIT >#66#return; 992221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992217#factFINAL assume true; 992214#factEXIT >#66#return; 992213#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992212#factFINAL assume true; 992206#factEXIT >#74#return; 987464#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 987465#factENTRY ~n := #in~n; 993346#L25 assume !(~n <= 0); 990583#L26 call #t~ret0 := fact(~n - 1);< 990588#factENTRY ~n := #in~n; 990593#L25 assume ~n <= 0;#res := 1; 990589#factFINAL assume true; 990579#factEXIT >#66#return; 990586#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993530#factFINAL assume true; 992945#factEXIT >#76#return; 990890#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 992943#factENTRY ~n := #in~n; 992942#L25 assume !(~n <= 0); 990660#L26 call #t~ret0 := fact(~n - 1);< 990889#factENTRY ~n := #in~n; 990888#L25 assume !(~n <= 0); 990690#L26 call #t~ret0 := fact(~n - 1);< 990839#factENTRY ~n := #in~n; 990997#L25 assume !(~n <= 0); 990811#L26 call #t~ret0 := fact(~n - 1);< 990995#factENTRY ~n := #in~n; 990996#L25 assume ~n <= 0;#res := 1; 990943#factFINAL assume true; 990872#factEXIT >#66#return; 990871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990837#factFINAL assume true; 990806#factEXIT >#66#return; 990814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990993#factFINAL assume true; 990893#factEXIT >#66#return; 990666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 994817#factFINAL assume true; 993008#factEXIT >#78#return; 990087#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; 990083#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 990081#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 990078#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 990074#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 990070#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 989898#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 989857#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; 989852#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989853#factENTRY ~n := #in~n; 989865#L25 assume !(~n <= 0); 987386#L26 call #t~ret0 := fact(~n - 1);< 989862#factENTRY ~n := #in~n; 987636#L25 assume !(~n <= 0); 987390#L26 call #t~ret0 := fact(~n - 1);< 989868#factENTRY ~n := #in~n; 989900#L25 assume ~n <= 0;#res := 1; 989869#factFINAL assume true; 989867#factEXIT >#66#return; 989866#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989863#factFINAL assume true; 989860#factEXIT >#66#return; 989856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989855#factFINAL assume true; 989851#factEXIT >#68#return; 987500#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 987612#factENTRY ~n := #in~n; 987623#L25 assume ~n <= 0;#res := 1; 987614#factFINAL assume true; 987497#factEXIT >#70#return; 987558#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 989847#factENTRY ~n := #in~n; 989859#L25 assume !(~n <= 0); 989647#L26 call #t~ret0 := fact(~n - 1);< 989854#factENTRY ~n := #in~n; 990219#L25 assume !(~n <= 0); 989645#L26 call #t~ret0 := fact(~n - 1);< 989762#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989675#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989850#factFINAL assume true; 989846#factEXIT >#72#return; 989827#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; 989825#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 989823#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 989821#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 989819#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; 989545#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989635#factENTRY ~n := #in~n; 990236#L25 assume !(~n <= 0); 989659#L26 call #t~ret0 := fact(~n - 1);< 989677#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989634#factFINAL assume true; 989541#factEXIT >#68#return; 989421#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989816#factENTRY ~n := #in~n; 990027#L25 assume !(~n <= 0); 989627#L26 call #t~ret0 := fact(~n - 1);< 989640#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989537#factFINAL assume true; 989240#factEXIT >#70#return; 989523#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 989845#factENTRY ~n := #in~n; 989858#L25 assume !(~n <= 0); 989621#L26 call #t~ret0 := fact(~n - 1);< 989633#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989632#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989848#factFINAL assume true; 989828#factEXIT >#72#return; 989826#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; 989824#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 989822#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 989820#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 989818#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; 989542#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989635#factENTRY ~n := #in~n; 990236#L25 assume !(~n <= 0); 989659#L26 call #t~ret0 := fact(~n - 1);< 989677#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989634#factFINAL assume true; 989541#factEXIT >#68#return; 989424#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989816#factENTRY ~n := #in~n; 990027#L25 assume !(~n <= 0); 989627#L26 call #t~ret0 := fact(~n - 1);< 989640#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989634#factFINAL assume true; 989541#factEXIT >#70#return; 989609#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 989814#factENTRY ~n := #in~n; 989817#L25 assume ~n <= 0;#res := 1; 989815#factFINAL assume true; 989777#factEXIT >#72#return; 989776#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; 989774#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 989772#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 989769#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 989765#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; 989700#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989752#factENTRY ~n := #in~n; 989985#L25 assume !(~n <= 0); 989652#L26 call #t~ret0 := fact(~n - 1);< 989902#factENTRY ~n := #in~n; 989876#L25 assume !(~n <= 0); 989661#L26 call #t~ret0 := fact(~n - 1);< 989763#factENTRY ~n := #in~n; 989876#L25 assume !(~n <= 0); 989661#L26 call #t~ret0 := fact(~n - 1);< 989763#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989755#factFINAL assume true; 989693#factEXIT >#74#return; 989543#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989636#factENTRY ~n := #in~n; 990072#L25 assume !(~n <= 0); 989622#L26 call #t~ret0 := fact(~n - 1);< 989640#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989634#factFINAL assume true; 989541#factEXIT >#76#return; 989369#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 990240#factENTRY ~n := #in~n; 990239#L25 assume !(~n <= 0); 989620#L26 call #t~ret0 := fact(~n - 1);< 989640#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989537#factFINAL assume true; 989240#factEXIT >#78#return; 989530#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; 992984#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 992985#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 993787#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 993785#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; 993042#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 993049#factENTRY ~n := #in~n; 993074#L25 assume !(~n <= 0); 993056#L26 call #t~ret0 := fact(~n - 1);< 993071#factENTRY ~n := #in~n; 993519#L25 assume !(~n <= 0); 993055#L26 call #t~ret0 := fact(~n - 1);< 993131#factENTRY ~n := #in~n; 993519#L25 assume !(~n <= 0); 993055#L26 call #t~ret0 := fact(~n - 1);< 993131#factENTRY ~n := #in~n; 993515#L25 assume ~n <= 0;#res := 1; 993514#factFINAL assume true; 993129#factEXIT >#66#return; 993127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993115#factFINAL assume true; 993096#factEXIT >#66#return; 993095#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993089#factFINAL assume true; 993053#factEXIT >#66#return; 993052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 993051#factFINAL assume true; 993039#factEXIT >#74#return; 993034#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 993038#factENTRY ~n := #in~n; 994136#L25 assume !(~n <= 0); 991748#L26 call #t~ret0 := fact(~n - 1);< 992360#factENTRY ~n := #in~n; 992693#L25 assume !(~n <= 0); 994574#L26 call #t~ret0 := fact(~n - 1);< 994579#factENTRY ~n := #in~n; 992886#L25 assume ~n <= 0;#res := 1; 994590#factFINAL assume true; 994573#factEXIT >#66#return; 994572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991791#factFINAL assume true; 991743#factEXIT >#66#return; 991759#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 994340#factFINAL assume true; 994339#factEXIT >#76#return; 991793#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 994082#factENTRY ~n := #in~n; 994571#L25 assume !(~n <= 0); 991744#L26 call #t~ret0 := fact(~n - 1);< 991765#factENTRY ~n := #in~n; 992693#L25 assume !(~n <= 0); 994574#L26 call #t~ret0 := fact(~n - 1);< 994579#factENTRY ~n := #in~n; 992886#L25 assume ~n <= 0;#res := 1; 994590#factFINAL assume true; 994573#factEXIT >#66#return; 994572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991791#factFINAL assume true; 991743#factEXIT >#66#return; 991753#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 994338#factFINAL assume true; 994081#factEXIT >#78#return; 992134#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; 994381#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 994380#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 994379#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 993583#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; 991523#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 991529#factENTRY ~n := #in~n; 991622#L25 assume !(~n <= 0); 991538#L26 call #t~ret0 := fact(~n - 1);< 991539#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991608#L25 assume ~n <= 0;#res := 1; 991607#factFINAL assume true; 991605#factEXIT >#66#return; 991604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991602#factFINAL assume true; 991592#factEXIT >#66#return; 991591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991590#factFINAL assume true; 991558#factEXIT >#66#return; 991557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991556#factFINAL assume true; 991552#factEXIT >#66#return; 991550#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991549#factFINAL assume true; 991545#factEXIT >#66#return; 991544#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991542#factFINAL assume true; 991534#factEXIT >#66#return; 991532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991531#factFINAL assume true; 991518#factEXIT >#74#return; 991302#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 991303#factENTRY ~n := #in~n; 991513#L25 assume !(~n <= 0); 990580#L26 call #t~ret0 := fact(~n - 1);< 990588#factENTRY ~n := #in~n; 990594#L25 assume !(~n <= 0); 990873#L26 call #t~ret0 := fact(~n - 1);< 990874#factENTRY ~n := #in~n; 990996#L25 assume ~n <= 0;#res := 1; 990943#factFINAL assume true; 990872#factEXIT >#66#return; 990871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990837#factFINAL assume true; 990806#factEXIT >#66#return; 990820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991473#factFINAL assume true; 991300#factEXIT >#76#return; 990545#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 990092#factENTRY ~n := #in~n; 994773#L25 assume !(~n <= 0); 990657#L26 call #t~ret0 := fact(~n - 1);< 990674#factENTRY ~n := #in~n; 990999#L25 assume !(~n <= 0); 990689#L26 call #t~ret0 := fact(~n - 1);< 990705#factENTRY ~n := #in~n; 991214#L25 assume !(~n <= 0); 990807#L26 call #t~ret0 := fact(~n - 1);< 990994#factENTRY ~n := #in~n; 994233#L25 assume !(~n <= 0); 990810#L26 call #t~ret0 := fact(~n - 1);< 990878#factENTRY ~n := #in~n; 990996#L25 assume ~n <= 0;#res := 1; 990943#factFINAL assume true; 990872#factEXIT >#66#return; 990871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990837#factFINAL assume true; 990806#factEXIT >#66#return; 990814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990993#factFINAL assume true; 990893#factEXIT >#66#return; 990900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990699#factFINAL assume true; 990685#factEXIT >#66#return; 990665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 994558#factFINAL assume true; 990544#factEXIT >#78#return; 990550#L30-8 [2022-11-18 20:37:10,411 INFO L750 eck$LassoCheckResult]: Loop: 990550#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; 994661#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 994660#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 994659#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 994658#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 994657#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 994656#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 990517#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; 989979#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989983#factENTRY ~n := #in~n; 989981#L25 assume !(~n <= 0); 987380#L26 call #t~ret0 := fact(~n - 1);< 989862#factENTRY ~n := #in~n; 987636#L25 assume !(~n <= 0); 987390#L26 call #t~ret0 := fact(~n - 1);< 989868#factENTRY ~n := #in~n; 987636#L25 assume !(~n <= 0); 987390#L26 call #t~ret0 := fact(~n - 1);< 989868#factENTRY ~n := #in~n; 989900#L25 assume ~n <= 0;#res := 1; 989869#factFINAL assume true; 989867#factEXIT >#66#return; 989866#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989863#factFINAL assume true; 989860#factEXIT >#66#return; 989861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990449#factFINAL assume true; 990443#factEXIT >#66#return; 990441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990440#factFINAL assume true; 990437#factEXIT >#68#return; 987505#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 987612#factENTRY ~n := #in~n; 987623#L25 assume ~n <= 0;#res := 1; 987614#factFINAL assume true; 987497#factEXIT >#70#return; 987563#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 990082#factENTRY ~n := #in~n; 990079#L25 assume !(~n <= 0); 989882#L26 call #t~ret0 := fact(~n - 1);< 990077#factENTRY ~n := #in~n; 990237#L25 assume !(~n <= 0); 989662#L26 call #t~ret0 := fact(~n - 1);< 989677#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990477#factFINAL assume true; 990474#factEXIT >#72#return; 990475#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; 990485#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 990479#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 990480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 990462#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; 989703#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989756#factENTRY ~n := #in~n; 990080#L25 assume !(~n <= 0); 989887#L26 call #t~ret0 := fact(~n - 1);< 990073#factENTRY ~n := #in~n; 990069#L25 assume !(~n <= 0); 989669#L26 call #t~ret0 := fact(~n - 1);< 989762#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989755#factFINAL assume true; 989693#factEXIT >#68#return; 989375#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989538#factENTRY ~n := #in~n; 990050#L25 assume !(~n <= 0); 989619#L26 call #t~ret0 := fact(~n - 1);< 989894#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989537#factFINAL assume true; 989240#factEXIT >#70#return; 989531#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 990059#factENTRY ~n := #in~n; 990057#L25 assume !(~n <= 0); 989646#L26 call #t~ret0 := fact(~n - 1);< 989677#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989674#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990435#factFINAL assume true; 990408#factEXIT >#72#return; 990406#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; 990407#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 990402#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 990403#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 990399#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; 989694#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989756#factENTRY ~n := #in~n; 990080#L25 assume !(~n <= 0); 989887#L26 call #t~ret0 := fact(~n - 1);< 990073#factENTRY ~n := #in~n; 990069#L25 assume !(~n <= 0); 989669#L26 call #t~ret0 := fact(~n - 1);< 989762#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989755#factFINAL assume true; 989693#factEXIT >#68#return; 989249#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989538#factENTRY ~n := #in~n; 990050#L25 assume !(~n <= 0); 989619#L26 call #t~ret0 := fact(~n - 1);< 989894#factENTRY ~n := #in~n; 990143#L25 assume !(~n <= 0); 989664#L26 call #t~ret0 := fact(~n - 1);< 989762#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989634#factFINAL assume true; 989541#factEXIT >#70#return; 989553#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 990055#factENTRY ~n := #in~n; 990053#L25 assume !(~n <= 0); 989623#L26 call #t~ret0 := fact(~n - 1);< 989640#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989632#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989848#factFINAL assume true; 989828#factEXIT >#72#return; 989838#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; 990398#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 990394#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 990395#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 990391#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; 989698#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989756#factENTRY ~n := #in~n; 990080#L25 assume !(~n <= 0); 989887#L26 call #t~ret0 := fact(~n - 1);< 990073#factENTRY ~n := #in~n; 990069#L25 assume !(~n <= 0); 989669#L26 call #t~ret0 := fact(~n - 1);< 989762#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989755#factFINAL assume true; 989693#factEXIT >#68#return; 989274#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 989538#factENTRY ~n := #in~n; 990050#L25 assume !(~n <= 0); 989619#L26 call #t~ret0 := fact(~n - 1);< 989894#factENTRY ~n := #in~n; 990143#L25 assume !(~n <= 0); 989664#L26 call #t~ret0 := fact(~n - 1);< 989762#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989755#factFINAL assume true; 989693#factEXIT >#70#return; 989727#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 989814#factENTRY ~n := #in~n; 989817#L25 assume ~n <= 0;#res := 1; 989815#factFINAL assume true; 989777#factEXIT >#72#return; 989811#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; 990390#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 990386#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 990387#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 990382#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; 989938#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 989991#factENTRY ~n := #in~n; 989986#L25 assume !(~n <= 0); 989655#L26 call #t~ret0 := fact(~n - 1);< 989902#factENTRY ~n := #in~n; 989876#L25 assume !(~n <= 0); 989661#L26 call #t~ret0 := fact(~n - 1);< 989763#factENTRY ~n := #in~n; 989876#L25 assume !(~n <= 0); 989661#L26 call #t~ret0 := fact(~n - 1);< 989763#factENTRY ~n := #in~n; 989876#L25 assume !(~n <= 0); 989661#L26 call #t~ret0 := fact(~n - 1);< 989763#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990335#factFINAL assume true; 990325#factEXIT >#66#return; 990328#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990520#factFINAL assume true; 990518#factEXIT >#74#return; 989705#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 990086#factENTRY ~n := #in~n; 990238#L25 assume !(~n <= 0); 989880#L26 call #t~ret0 := fact(~n - 1);< 990077#factENTRY ~n := #in~n; 990237#L25 assume !(~n <= 0); 989662#L26 call #t~ret0 := fact(~n - 1);< 989677#factENTRY ~n := #in~n; 990235#L25 assume !(~n <= 0); 989760#L26 call #t~ret0 := fact(~n - 1);< 989761#factENTRY ~n := #in~n; 989929#L25 assume ~n <= 0;#res := 1; 989870#factFINAL assume true; 989759#factEXIT >#66#return; 989754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989679#factFINAL assume true; 989644#factEXIT >#66#return; 989676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989904#factFINAL assume true; 989877#factEXIT >#66#return; 989764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989755#factFINAL assume true; 989693#factEXIT >#76#return; 989337#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 990240#factENTRY ~n := #in~n; 990239#L25 assume !(~n <= 0); 989620#L26 call #t~ret0 := fact(~n - 1);< 989640#factENTRY ~n := #in~n; 989643#L25 assume ~n <= 0;#res := 1; 989638#factFINAL assume true; 989612#factEXIT >#66#return; 989540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 989537#factFINAL assume true; 989240#factEXIT >#78#return; 989476#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; 994637#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 994629#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 994620#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 992253#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; 992002#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 992373#factENTRY ~n := #in~n; 994488#L25 assume !(~n <= 0); 992446#L26 call #t~ret0 := fact(~n - 1);< 992474#factENTRY ~n := #in~n; 994518#L25 assume !(~n <= 0); 992438#L26 call #t~ret0 := fact(~n - 1);< 992582#factENTRY ~n := #in~n; 994518#L25 assume !(~n <= 0); 992438#L26 call #t~ret0 := fact(~n - 1);< 992582#factENTRY ~n := #in~n; 994518#L25 assume !(~n <= 0); 992438#L26 call #t~ret0 := fact(~n - 1);< 992582#factENTRY ~n := #in~n; 994518#L25 assume !(~n <= 0); 992438#L26 call #t~ret0 := fact(~n - 1);< 992582#factENTRY ~n := #in~n; 992605#L25 assume ~n <= 0;#res := 1; 992603#factFINAL assume true; 992576#factEXIT >#66#return; 992575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992567#factFINAL assume true; 992545#factEXIT >#66#return; 992557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992580#factFINAL assume true; 992529#factEXIT >#66#return; 992539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 994489#factFINAL assume true; 992428#factEXIT >#66#return; 992467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 994276#factFINAL assume true; 994256#factEXIT >#66#return; 992426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992142#factFINAL assume true; 991947#factEXIT >#74#return; 991710#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 992371#factENTRY ~n := #in~n; 994594#L25 assume !(~n <= 0); 991690#L26 call #t~ret0 := fact(~n - 1);< 991698#factENTRY ~n := #in~n; 991769#L25 assume !(~n <= 0); 991749#L26 call #t~ret0 := fact(~n - 1);< 991765#factENTRY ~n := #in~n; 992693#L25 assume !(~n <= 0); 994574#L26 call #t~ret0 := fact(~n - 1);< 994579#factENTRY ~n := #in~n; 992886#L25 assume ~n <= 0;#res := 1; 994590#factFINAL assume true; 994573#factEXIT >#66#return; 994572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991791#factFINAL assume true; 991743#factEXIT >#66#return; 991717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991706#factFINAL assume true; 991683#factEXIT >#66#return; 991696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992604#factFINAL assume true; 992370#factEXIT >#76#return; 992124#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 992140#factENTRY ~n := #in~n; 992504#L25 assume !(~n <= 0); 991751#L26 call #t~ret0 := fact(~n - 1);< 991765#factENTRY ~n := #in~n; 992693#L25 assume !(~n <= 0); 994574#L26 call #t~ret0 := fact(~n - 1);< 994579#factENTRY ~n := #in~n; 992886#L25 assume ~n <= 0;#res := 1; 994590#factFINAL assume true; 994573#factEXIT >#66#return; 994572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991791#factFINAL assume true; 991743#factEXIT >#66#return; 991757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992279#factFINAL assume true; 992123#factEXIT >#78#return; 992132#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; 992368#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 992367#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 992365#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 992363#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; 991522#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 991529#factENTRY ~n := #in~n; 991622#L25 assume !(~n <= 0); 991538#L26 call #t~ret0 := fact(~n - 1);< 991539#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991555#L25 assume !(~n <= 0); 991535#L26 call #t~ret0 := fact(~n - 1);< 991553#factENTRY ~n := #in~n; 991608#L25 assume ~n <= 0;#res := 1; 991607#factFINAL assume true; 991605#factEXIT >#66#return; 991604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991602#factFINAL assume true; 991592#factEXIT >#66#return; 991591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991590#factFINAL assume true; 991558#factEXIT >#66#return; 991557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991556#factFINAL assume true; 991552#factEXIT >#66#return; 991550#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991549#factFINAL assume true; 991545#factEXIT >#66#return; 991544#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991542#factFINAL assume true; 991534#factEXIT >#66#return; 991532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 991531#factFINAL assume true; 991518#factEXIT >#74#return; 991527#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 992591#factENTRY ~n := #in~n; 992597#L25 assume !(~n <= 0); 990898#L26 call #t~ret0 := fact(~n - 1);< 990905#factENTRY ~n := #in~n; 991003#L25 assume !(~n <= 0); 990809#L26 call #t~ret0 := fact(~n - 1);< 990844#factENTRY ~n := #in~n; 990594#L25 assume !(~n <= 0); 990873#L26 call #t~ret0 := fact(~n - 1);< 990874#factENTRY ~n := #in~n; 990996#L25 assume ~n <= 0;#res := 1; 990943#factFINAL assume true; 990872#factEXIT >#66#return; 990871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990837#factFINAL assume true; 990806#factEXIT >#66#return; 990814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990993#factFINAL assume true; 990893#factEXIT >#66#return; 990899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 992596#factFINAL assume true; 992590#factEXIT >#76#return; 990546#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 987473#factENTRY ~n := #in~n; 994561#L25 assume !(~n <= 0); 990663#L26 call #t~ret0 := fact(~n - 1);< 990889#factENTRY ~n := #in~n; 990888#L25 assume !(~n <= 0); 990690#L26 call #t~ret0 := fact(~n - 1);< 990839#factENTRY ~n := #in~n; 990997#L25 assume !(~n <= 0); 990811#L26 call #t~ret0 := fact(~n - 1);< 990995#factENTRY ~n := #in~n; 990996#L25 assume ~n <= 0;#res := 1; 990943#factFINAL assume true; 990872#factEXIT >#66#return; 990871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990837#factFINAL assume true; 990806#factEXIT >#66#return; 990814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 990993#factFINAL assume true; 990893#factEXIT >#66#return; 990903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 994667#factFINAL assume true; 994663#factEXIT >#78#return; 990550#L30-8 [2022-11-18 20:37:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 234198363, now seen corresponding path program 63 times [2022-11-18 20:37:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:37:10,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059045211] [2022-11-18 20:37:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:37:10,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:37:10,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054426289] [2022-11-18 20:37:10,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:37:10,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:37:10,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:37:10,476 INFO L229 MonitoredProcess]: Starting monitored process 337 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:37:10,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (337)] Waiting until timeout for monitored process [2022-11-18 20:37:12,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-18 20:37:12,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:37:12,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:37:12,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 38170 backedges. 3356 proven. 200 refuted. 0 times theorem prover too weak. 34614 trivial. 0 not checked. [2022-11-18 20:37:13,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 38170 backedges. 3356 proven. 213 refuted. 0 times theorem prover too weak. 34601 trivial. 0 not checked. [2022-11-18 20:37:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:37:14,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059045211] [2022-11-18 20:37:14,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:37:14,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054426289] [2022-11-18 20:37:14,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054426289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:37:14,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:14,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 22 [2022-11-18 20:37:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136700415] [2022-11-18 20:37:14,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:14,698 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-18 20:37:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -9081509, now seen corresponding path program 47 times [2022-11-18 20:37:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:37:14,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187391305] [2022-11-18 20:37:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:37:14,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:37:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053074548] [2022-11-18 20:37:14,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:37:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:37:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:37:14,735 INFO L229 MonitoredProcess]: Starting monitored process 338 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:37:14,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7eb771d7-9690-43b2-8869-d5366b06487f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (338)] Waiting until timeout for monitored process [2022-11-18 20:37:17,436 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-11-18 20:37:17,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:37:17,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:37:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:37:19,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace