./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:10:48,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:10:48,721 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-29 01:10:48,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:10:48,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:10:48,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:10:48,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:10:48,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:10:48,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:10:48,756 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:10:48,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:10:48,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:10:48,758 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:10:48,759 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 01:10:48,759 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 01:10:48,760 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 01:10:48,760 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 01:10:48,761 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 01:10:48,761 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 01:10:48,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:10:48,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 01:10:48,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:10:48,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:10:48,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 01:10:48,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 01:10:48,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 01:10:48,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:10:48,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:10:48,766 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 01:10:48,766 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:10:48,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:10:48,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:10:48,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:10:48,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:10:48,768 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 01:10:48,768 INFO L153 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_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/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_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 [2023-11-29 01:10:48,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:10:49,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:10:49,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:10:49,014 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:10:49,014 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:10:49,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/termination-numeric/Binomial.c [2023-11-29 01:10:51,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:10:51,868 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:10:51,868 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/sv-benchmarks/c/termination-numeric/Binomial.c [2023-11-29 01:10:51,875 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/data/534984dda/de94df3ee0234fc787b790c8c88fe852/FLAGcf0a242cd [2023-11-29 01:10:51,886 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/data/534984dda/de94df3ee0234fc787b790c8c88fe852 [2023-11-29 01:10:51,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:10:51,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:10:51,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:10:51,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:10:51,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:10:51,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:10:51" (1/1) ... [2023-11-29 01:10:51,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166190f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:51, skipping insertion in model container [2023-11-29 01:10:51,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:10:51" (1/1) ... [2023-11-29 01:10:51,916 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:10:52,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:10:52,049 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:10:52,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:10:52,078 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:10:52,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52 WrapperNode [2023-11-29 01:10:52,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:10:52,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:10:52,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:10:52,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:10:52,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,112 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2023-11-29 01:10:52,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:10:52,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:10:52,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:10:52,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:10:52,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,133 INFO L175 MemorySlicer]: No memory access in input program. [2023-11-29 01:10:52,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:10:52,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:10:52,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:10:52,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:10:52,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (1/1) ... [2023-11-29 01:10:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:52,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:52,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:52,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 01:10:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2023-11-29 01:10:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2023-11-29 01:10:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:10:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:10:52,277 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:10:52,278 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:10:52,402 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:10:52,413 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:10:52,414 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 01:10:52,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:52 BoogieIcfgContainer [2023-11-29 01:10:52,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:10:52,417 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 01:10:52,417 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 01:10:52,421 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 01:10:52,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:10:52,422 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 01:10:51" (1/3) ... [2023-11-29 01:10:52,423 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19435600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 01:10:52, skipping insertion in model container [2023-11-29 01:10:52,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:10:52,423 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:10:52" (2/3) ... [2023-11-29 01:10:52,423 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19435600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 01:10:52, skipping insertion in model container [2023-11-29 01:10:52,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 01:10:52,424 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:10:52" (3/3) ... [2023-11-29 01:10:52,425 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2023-11-29 01:10:52,475 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 01:10:52,475 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 01:10:52,475 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 01:10:52,475 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 01:10:52,475 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 01:10:52,475 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 01:10:52,476 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 01:10:52,476 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 01:10:52,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:10:52,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-11-29 01:10:52,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:52,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:52,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 01:10:52,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 01:10:52,501 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 01:10:52,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:10:52,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-11-29 01:10:52,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:52,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:52,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 01:10:52,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-29 01:10:52,512 INFO L748 eck$LassoCheckResult]: Stem: 27#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15#L35true assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28#L38true assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 11#L41-3true [2023-11-29 01:10:52,512 INFO L750 eck$LassoCheckResult]: Loop: 11#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 21#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 30#L42-4true havoc main_~k~0#1; 13#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 11#L41-3true [2023-11-29 01:10:52,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2023-11-29 01:10:52,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:52,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467763577] [2023-11-29 01:10:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:52,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:52,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:52,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1792233, now seen corresponding path program 1 times [2023-11-29 01:10:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356091028] [2023-11-29 01:10:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:52,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:52,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:52,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash -15995056, now seen corresponding path program 1 times [2023-11-29 01:10:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:52,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130038170] [2023-11-29 01:10:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:52,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130038170] [2023-11-29 01:10:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130038170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:52,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:52,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:10:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458047599] [2023-11-29 01:10:52,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:52,775 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:52,775 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:52,775 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:52,776 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:52,776 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:10:52,776 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:52,776 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:52,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:52,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-11-29 01:10:52,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:52,777 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:52,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:52,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:52,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:52,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:52,850 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:10:52,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:52,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:52,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:52,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 01:10:52,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:52,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:52,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:52,883 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:52,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:52,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:52,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:52,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:52,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 01:10:52,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:52,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:52,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:52,916 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:52,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 01:10:52,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:52,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:52,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 01:10:52,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:52,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:52,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 01:10:52,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:52,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:52,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:52,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 01:10:52,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:10:52,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:53,042 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:10:53,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 01:10:53,046 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:53,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:53,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:53,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:53,046 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:10:53,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:53,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:53,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:53,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-11-29 01:10:53,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:53,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:53,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:53,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:53,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:53,089 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:53,093 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:10:53,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:53,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:53,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 01:10:53,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:53,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:53,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:53,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:53,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:53,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:53,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:53,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:53,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:53,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 01:10:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:53,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:53,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 01:10:53,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:53,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:53,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:53,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:53,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:53,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:53,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:53,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:53,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:53,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 01:10:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:53,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:53,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 01:10:53,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:53,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:53,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:53,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:53,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:53,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:53,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:53,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:53,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:10:53,167 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:10:53,168 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-29 01:10:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:53,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:53,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:53,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 01:10:53,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:10:53,189 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:10:53,190 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:10:53,190 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-11-29 01:10:53,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-29 01:10:53,197 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:10:53,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:53,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:10:53,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:53,245 WARN L260 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:10:53,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:53,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-29 01:10:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:53,363 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-29 01:10:53,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:53,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 109 transitions. Complement of second has 13 states. [2023-11-29 01:10:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-11-29 01:10:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2023-11-29 01:10:53,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-29 01:10:53,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 8 letters. Loop has 4 letters. [2023-11-29 01:10:53,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 4 letters. Loop has 8 letters. [2023-11-29 01:10:53,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:53,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 109 transitions. [2023-11-29 01:10:53,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-11-29 01:10:53,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 35 states and 50 transitions. [2023-11-29 01:10:53,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-29 01:10:53,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-29 01:10:53,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 50 transitions. [2023-11-29 01:10:53,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:53,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 50 transitions. [2023-11-29 01:10:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 50 transitions. [2023-11-29 01:10:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-11-29 01:10:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:10:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-11-29 01:10:53,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-11-29 01:10:53,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:10:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:10:53,531 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:53,582 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-11-29 01:10:53,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2023-11-29 01:10:53,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-29 01:10:53,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 29 states and 38 transitions. [2023-11-29 01:10:53,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-29 01:10:53,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-29 01:10:53,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2023-11-29 01:10:53,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:53,587 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-11-29 01:10:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2023-11-29 01:10:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-29 01:10:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:10:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-29 01:10:53,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-29 01:10:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:10:53,592 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-29 01:10:53,593 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 01:10:53,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2023-11-29 01:10:53,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-29 01:10:53,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:53,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:53,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 01:10:53,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:53,596 INFO L748 eck$LassoCheckResult]: Stem: 256#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 244#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 245#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 251#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 247#L41-3 [2023-11-29 01:10:53,596 INFO L750 eck$LassoCheckResult]: Loop: 247#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 253#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 231#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 232#$Ultimate##0 ~n := #in~n; 254#L25 assume ~n <= 0;#res := 1; 243#factFINAL assume true; 233#factEXIT >#78#return; 237#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 232#$Ultimate##0 ~n := #in~n; 254#L25 assume ~n <= 0;#res := 1; 243#factFINAL assume true; 233#factEXIT >#80#return; 239#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 232#$Ultimate##0 ~n := #in~n; 254#L25 assume ~n <= 0;#res := 1; 243#factFINAL assume true; 233#factEXIT >#82#return; 242#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 246#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 252#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 255#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 257#L42-4 havoc main_~k~0#1; 250#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247#L41-3 [2023-11-29 01:10:53,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2023-11-29 01:10:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028774236] [2023-11-29 01:10:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:53,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:53,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2022384732, now seen corresponding path program 1 times [2023-11-29 01:10:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:53,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859894421] [2023-11-29 01:10:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:53,625 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:10:53,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410184608] [2023-11-29 01:10:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:53,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:53,627 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:53,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:10:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:53,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:10:53,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:10:53,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:10:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859894421] [2023-11-29 01:10:53,726 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:10:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410184608] [2023-11-29 01:10:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410184608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:10:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279473745] [2023-11-29 01:10:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:53,727 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:10:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:53,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:10:53,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:10:53,729 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 01:10:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:53,796 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2023-11-29 01:10:53,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2023-11-29 01:10:53,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-29 01:10:53,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 43 transitions. [2023-11-29 01:10:53,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-29 01:10:53,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-29 01:10:53,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2023-11-29 01:10:53,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:10:53,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-11-29 01:10:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2023-11-29 01:10:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 01:10:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-11-29 01:10:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-11-29 01:10:53,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-11-29 01:10:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:10:53,806 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-11-29 01:10:53,806 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 01:10:53,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2023-11-29 01:10:53,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-11-29 01:10:53,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:53,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:53,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 01:10:53,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:53,809 INFO L748 eck$LassoCheckResult]: Stem: 393#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 379#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 380#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 387#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 383#L41-3 [2023-11-29 01:10:53,809 INFO L750 eck$LassoCheckResult]: Loop: 383#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 384#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 389#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 372#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 367#$Ultimate##0 ~n := #in~n; 390#L25 assume ~n <= 0;#res := 1; 391#factFINAL assume true; 368#factEXIT >#72#return; 374#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 367#$Ultimate##0 ~n := #in~n; 390#L25 assume ~n <= 0;#res := 1; 391#factFINAL assume true; 368#factEXIT >#74#return; 371#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 367#$Ultimate##0 ~n := #in~n; 390#L25 assume ~n <= 0;#res := 1; 391#factFINAL assume true; 368#factEXIT >#76#return; 375#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 385#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 388#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 392#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 394#L42-4 havoc main_~k~0#1; 386#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 383#L41-3 [2023-11-29 01:10:53,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:53,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2023-11-29 01:10:53,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:53,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522053964] [2023-11-29 01:10:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:53,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash -481826528, now seen corresponding path program 1 times [2023-11-29 01:10:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607606933] [2023-11-29 01:10:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:53,829 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:10:53,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359610191] [2023-11-29 01:10:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:53,831 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:53,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:10:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:53,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1147386361, now seen corresponding path program 1 times [2023-11-29 01:10:53,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:53,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025300590] [2023-11-29 01:10:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:53,908 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:10:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895165869] [2023-11-29 01:10:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:53,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:53,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:53,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:53,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:10:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:53,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:54,286 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:54,286 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:54,286 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:54,286 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:54,286 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:10:54,286 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,286 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:54,286 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:54,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-11-29 01:10:54,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:54,287 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:54,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,399 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:54,399 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:10:54,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-29 01:10:54,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,435 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,435 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-29 01:10:54,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,441 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 01:10:54,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,459 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 01:10:54,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 01:10:54,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,477 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,478 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-29 01:10:54,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,482 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 01:10:54,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,496 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,496 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-29 01:10:54,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,499 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 01:10:54,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,513 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,513 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 01:10:54,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,516 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 01:10:54,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,530 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,530 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-29 01:10:54,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,534 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 01:10:54,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,551 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 01:10:54,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,565 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:54,565 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:54,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 01:10:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,569 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 01:10:54,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:54,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-29 01:10:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,586 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 01:10:54,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:10:54,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:54,635 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:10:54,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:54,639 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:54,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:54,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:54,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:54,639 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:10:54,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:54,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:54,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-11-29 01:10:54,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:54,640 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:54,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:54,724 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:54,724 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:10:54,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,725 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 01:10:54,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 [2023-11-29 01:10:54,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 01:10:54,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,746 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-29 01:10:54,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:54,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-29 01:10:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,767 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-29 01:10:54,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:54,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:54,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,785 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 01:10:54,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 [2023-11-29 01:10:54,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:54,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,803 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 01:10:54,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:54,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 01:10:54,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,821 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 01:10:54,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:54,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:54,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,840 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-29 01:10:54,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:54,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-29 01:10:54,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,860 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-29 01:10:54,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:54,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:54,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:54,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,878 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-29 01:10:54,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:54,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:54,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:54,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:54,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:54,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:54,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:54,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:54,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:10:54,902 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-11-29 01:10:54,902 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-29 01:10:54,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:54,903 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-29 01:10:54,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:10:54,906 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:10:54,906 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:10:54,906 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2023-11-29 01:10:54,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-29 01:10:54,909 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:10:54,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:10:54,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:54,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:10:54,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:10:55,134 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2023-11-29 01:10:55,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:10:55,388 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 43 transitions. cyclomatic complexity: 16. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 119 states and 178 transitions. Complement of second has 28 states. [2023-11-29 01:10:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2023-11-29 01:10:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:10:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2023-11-29 01:10:55,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 24 letters. [2023-11-29 01:10:55,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:55,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 28 letters. Loop has 24 letters. [2023-11-29 01:10:55,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:55,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 71 transitions. Stem has 4 letters. Loop has 48 letters. [2023-11-29 01:10:55,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:55,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 178 transitions. [2023-11-29 01:10:55,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-29 01:10:55,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 117 states and 176 transitions. [2023-11-29 01:10:55,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-11-29 01:10:55,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2023-11-29 01:10:55,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 176 transitions. [2023-11-29 01:10:55,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:55,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 176 transitions. [2023-11-29 01:10:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 176 transitions. [2023-11-29 01:10:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2023-11-29 01:10:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 30 states have call successors, (30), 6 states have call predecessors, (30), 10 states have return successors, (50), 30 states have call predecessors, (50), 30 states have call successors, (50) [2023-11-29 01:10:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2023-11-29 01:10:55,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 167 transitions. [2023-11-29 01:10:55,423 INFO L428 stractBuchiCegarLoop]: Abstraction has 112 states and 167 transitions. [2023-11-29 01:10:55,423 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 01:10:55,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 167 transitions. [2023-11-29 01:10:55,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-29 01:10:55,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:55,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:55,427 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-29 01:10:55,427 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, 1] [2023-11-29 01:10:55,428 INFO L748 eck$LassoCheckResult]: Stem: 716#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 680#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 681#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 699#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 717#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 690#L42-3 [2023-11-29 01:10:55,428 INFO L750 eck$LassoCheckResult]: Loop: 690#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 702#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 704#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 731#$Ultimate##0 ~n := #in~n; 739#L25 assume !(~n <= 0); 737#L26 call #t~ret0 := fact(~n - 1);< 687#$Ultimate##0 ~n := #in~n; 742#L25 assume ~n <= 0;#res := 1; 741#factFINAL assume true; 735#factEXIT >#70#return; 734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 733#factFINAL assume true; 726#factEXIT >#78#return; 730#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 731#$Ultimate##0 ~n := #in~n; 739#L25 assume !(~n <= 0); 737#L26 call #t~ret0 := fact(~n - 1);< 687#$Ultimate##0 ~n := #in~n; 742#L25 assume ~n <= 0;#res := 1; 741#factFINAL assume true; 735#factEXIT >#70#return; 734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 733#factFINAL assume true; 726#factEXIT >#80#return; 728#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 731#$Ultimate##0 ~n := #in~n; 739#L25 assume !(~n <= 0); 737#L26 call #t~ret0 := fact(~n - 1);< 687#$Ultimate##0 ~n := #in~n; 742#L25 assume ~n <= 0;#res := 1; 741#factFINAL assume true; 735#factEXIT >#70#return; 734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 733#factFINAL assume true; 726#factEXIT >#82#return; 724#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 722#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 721#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 720#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 718#L42-4 havoc main_~k~0#1; 696#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 689#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 690#L42-3 [2023-11-29 01:10:55,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2023-11-29 01:10:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328529143] [2023-11-29 01:10:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:55,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:55,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:55,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1950250366, now seen corresponding path program 1 times [2023-11-29 01:10:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:55,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848469787] [2023-11-29 01:10:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:55,446 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:10:55,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109476740] [2023-11-29 01:10:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:55,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:55,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:55,451 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:55,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-11-29 01:10:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:55,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 01:10:55,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 39 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 01:10:55,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:55,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 01:10:55,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:55,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848469787] [2023-11-29 01:10:55,823 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:10:55,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109476740] [2023-11-29 01:10:55,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109476740] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:10:55,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:55,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2023-11-29 01:10:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604062450] [2023-11-29 01:10:55,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:55,824 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:10:55,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:55,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:10:55,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:10:55,825 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. cyclomatic complexity: 60 Second operand has 13 states, 10 states have (on average 3.6) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-29 01:10:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:56,040 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2023-11-29 01:10:56,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 301 transitions. [2023-11-29 01:10:56,046 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 55 [2023-11-29 01:10:56,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 301 transitions. [2023-11-29 01:10:56,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2023-11-29 01:10:56,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2023-11-29 01:10:56,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 301 transitions. [2023-11-29 01:10:56,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:56,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 301 transitions. [2023-11-29 01:10:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 301 transitions. [2023-11-29 01:10:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 148. [2023-11-29 01:10:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.153061224489796) internal successors, (113), 95 states have internal predecessors, (113), 34 states have call successors, (34), 14 states have call predecessors, (34), 16 states have return successors, (84), 38 states have call predecessors, (84), 34 states have call successors, (84) [2023-11-29 01:10:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 231 transitions. [2023-11-29 01:10:56,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 231 transitions. [2023-11-29 01:10:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:10:56,077 INFO L428 stractBuchiCegarLoop]: Abstraction has 148 states and 231 transitions. [2023-11-29 01:10:56,077 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 01:10:56,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 231 transitions. [2023-11-29 01:10:56,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-11-29 01:10:56,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:56,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:56,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-29 01:10:56,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:56,082 INFO L748 eck$LassoCheckResult]: Stem: 1299#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1259#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1260#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1278#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1300#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1268#L42-3 [2023-11-29 01:10:56,082 INFO L750 eck$LassoCheckResult]: Loop: 1268#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1281#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1251#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1232#$Ultimate##0 ~n := #in~n; 1364#L25 assume !(~n <= 0); 1237#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume !(~n <= 0); 1238#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume ~n <= 0;#res := 1; 1334#factFINAL assume true; 1332#factEXIT >#70#return; 1241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1253#factFINAL assume true; 1235#factEXIT >#70#return; 1240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1342#factFINAL assume true; 1338#factEXIT >#72#return; 1291#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1232#$Ultimate##0 ~n := #in~n; 1364#L25 assume !(~n <= 0); 1237#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume !(~n <= 0); 1238#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume ~n <= 0;#res := 1; 1334#factFINAL assume true; 1332#factEXIT >#70#return; 1241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1253#factFINAL assume true; 1235#factEXIT >#70#return; 1240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1342#factFINAL assume true; 1338#factEXIT >#74#return; 1249#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1232#$Ultimate##0 ~n := #in~n; 1364#L25 assume !(~n <= 0); 1237#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume !(~n <= 0); 1238#L26 call #t~ret0 := fact(~n - 1);< 1265#$Ultimate##0 ~n := #in~n; 1336#L25 assume ~n <= 0;#res := 1; 1334#factFINAL assume true; 1332#factEXIT >#70#return; 1241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1253#factFINAL assume true; 1235#factEXIT >#70#return; 1240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1342#factFINAL assume true; 1338#factEXIT >#76#return; 1271#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1272#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1279#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1304#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1302#L42-4 havoc main_~k~0#1; 1275#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1267#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1268#L42-3 [2023-11-29 01:10:56,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2023-11-29 01:10:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:56,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412328980] [2023-11-29 01:10:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:56,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:56,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:56,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash -822334974, now seen corresponding path program 1 times [2023-11-29 01:10:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567465862] [2023-11-29 01:10:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:56,100 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:10:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474311414] [2023-11-29 01:10:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:56,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:56,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:56,102 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:56,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-11-29 01:10:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:56,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:10:56,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 16 proven. 103 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 01:10:56,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 16 proven. 109 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-29 01:10:56,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567465862] [2023-11-29 01:10:56,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:10:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474311414] [2023-11-29 01:10:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474311414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:10:56,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:56,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2023-11-29 01:10:56,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906444244] [2023-11-29 01:10:56,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:56,729 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:10:56,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:56,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:10:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:10:56,730 INFO L87 Difference]: Start difference. First operand 148 states and 231 transitions. cyclomatic complexity: 88 Second operand has 17 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (13), 9 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-29 01:10:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:57,115 INFO L93 Difference]: Finished difference Result 252 states and 423 transitions. [2023-11-29 01:10:57,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 423 transitions. [2023-11-29 01:10:57,121 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 65 [2023-11-29 01:10:57,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 240 states and 407 transitions. [2023-11-29 01:10:57,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2023-11-29 01:10:57,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2023-11-29 01:10:57,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 407 transitions. [2023-11-29 01:10:57,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:57,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 240 states and 407 transitions. [2023-11-29 01:10:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 407 transitions. [2023-11-29 01:10:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2023-11-29 01:10:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 107 states have internal predecessors, (125), 46 states have call successors, (46), 14 states have call predecessors, (46), 22 states have return successors, (142), 56 states have call predecessors, (142), 46 states have call successors, (142) [2023-11-29 01:10:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 313 transitions. [2023-11-29 01:10:57,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 178 states and 313 transitions. [2023-11-29 01:10:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:10:57,156 INFO L428 stractBuchiCegarLoop]: Abstraction has 178 states and 313 transitions. [2023-11-29 01:10:57,156 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 01:10:57,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 313 transitions. [2023-11-29 01:10:57,158 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 41 [2023-11-29 01:10:57,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:57,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:57,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-29 01:10:57,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:57,160 INFO L748 eck$LassoCheckResult]: Stem: 2098#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2048#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2049#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2065#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 2099#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2057#L42-3 [2023-11-29 01:10:57,160 INFO L750 eck$LassoCheckResult]: Loop: 2057#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2085#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2019#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2020#$Ultimate##0 ~n := #in~n; 2196#L25 assume !(~n <= 0); 2053#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume ~n <= 0;#res := 1; 2132#factFINAL assume true; 2127#factEXIT >#70#return; 2128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2046#factFINAL assume true; 2023#factEXIT >#78#return; 2032#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2042#$Ultimate##0 ~n := #in~n; 2092#L25 assume ~n <= 0;#res := 1; 2131#factFINAL assume true; 2123#factEXIT >#80#return; 2029#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2100#$Ultimate##0 ~n := #in~n; 2087#L25 assume !(~n <= 0); 2053#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume !(~n <= 0); 2075#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume !(~n <= 0); 2075#L26 call #t~ret0 := fact(~n - 1);< 2054#$Ultimate##0 ~n := #in~n; 2137#L25 assume ~n <= 0;#res := 1; 2132#factFINAL assume true; 2127#factEXIT >#70#return; 2129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2142#factFINAL assume true; 2140#factEXIT >#70#return; 2074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077#factFINAL assume true; 2145#factEXIT >#70#return; 2146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2149#factFINAL assume true; 2147#factEXIT >#82#return; 2033#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2050#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2066#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2105#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2103#L42-4 havoc main_~k~0#1; 2063#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2056#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2057#L42-3 [2023-11-29 01:10:57,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2023-11-29 01:10:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384670412] [2023-11-29 01:10:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:57,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:57,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:57,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1102369410, now seen corresponding path program 2 times [2023-11-29 01:10:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:57,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407963299] [2023-11-29 01:10:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:57,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:57,177 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:10:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485020853] [2023-11-29 01:10:57,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:10:57,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:57,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,181 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-29 01:10:57,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:10:57,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:10:57,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:57,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:57,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash -694339919, now seen corresponding path program 1 times [2023-11-29 01:10:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:57,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518641011] [2023-11-29 01:10:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:57,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518641011] [2023-11-29 01:10:57,276 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-29 01:10:57,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389061508] [2023-11-29 01:10:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,277 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-11-29 01:10:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:57,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:10:57,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-29 01:10:57,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:10:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389061508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:57,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:57,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:10:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491573573] [2023-11-29 01:10:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:57,739 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:57,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:57,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:57,739 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:57,739 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:10:57,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:57,740 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:57,740 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2023-11-29 01:10:57,740 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:57,740 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:57,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,823 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:57,823 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:10:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,824 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-29 01:10:57,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:57,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:57,838 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:57,838 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:57,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:57,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,841 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-29 01:10:57,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:57,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:57,855 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:57,855 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:57,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-11-29 01:10:57,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,858 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-29 01:10:57,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:57,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:57,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:57,872 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:57,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:57,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,876 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-29 01:10:57,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:57,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:57,890 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:57,890 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:57,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:57,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,894 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-29 01:10:57,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:57,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:57,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-11-29 01:10:57,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:57,911 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-29 01:10:57,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:10:57,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:57,927 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:10:57,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:57,930 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:57,930 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:57,930 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:57,930 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:57,930 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:10:57,930 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:57,930 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:57,930 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:57,930 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration6_Loop [2023-11-29 01:10:57,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:57,931 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:57,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:57,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:58,017 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:58,017 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:10:58,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,018 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-29 01:10:58,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:58,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:58,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:58,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:58,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:58,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:58,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:58,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:58,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:58,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,035 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-29 01:10:58,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:58,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:58,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:58,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:58,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:58,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:58,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:58,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:58,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:58,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-29 01:10:58,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,052 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-29 01:10:58,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:58,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:58,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:58,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:58,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:58,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:58,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:58,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:58,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:58,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:58,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,069 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-29 01:10:58,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:58,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:58,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:58,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:58,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:58,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:58,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:58,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:58,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:58,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:58,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,086 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-29 01:10:58,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:58,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:58,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:58,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:58,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:58,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:58,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:58,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:58,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:58,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:58,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,103 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-29 01:10:58,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 [2023-11-29 01:10:58,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:58,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:58,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:58,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:58,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:58,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:58,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:58,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:58,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-29 01:10:58,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,121 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-29 01:10:58,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:58,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:58,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:58,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:58,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:58,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:58,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:58,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:58,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:10:58,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:10:58,139 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-29 01:10:58,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,140 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-29 01:10:58,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:10:58,142 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:10:58,142 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:10:58,142 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 [] [2023-11-29 01:10:58,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-11-29 01:10:58,145 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:10:58,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:58,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:10:58,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:58,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 01:10:58,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 01:10:58,312 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2023-11-29 01:10:58,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 178 states and 313 transitions. cyclomatic complexity: 140 Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 01:10:58,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 178 states and 313 transitions. cyclomatic complexity: 140. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Result 995 states and 1573 transitions. Complement of second has 49 states. [2023-11-29 01:10:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2023-11-29 01:10:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 01:10:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2023-11-29 01:10:58,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 5 letters. Loop has 48 letters. [2023-11-29 01:10:58,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:58,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 53 letters. Loop has 48 letters. [2023-11-29 01:10:58,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:58,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 5 letters. Loop has 96 letters. [2023-11-29 01:10:58,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:58,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 995 states and 1573 transitions. [2023-11-29 01:10:58,666 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 81 [2023-11-29 01:10:58,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 995 states to 699 states and 1106 transitions. [2023-11-29 01:10:58,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2023-11-29 01:10:58,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2023-11-29 01:10:58,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 1106 transitions. [2023-11-29 01:10:58,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:58,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 699 states and 1106 transitions. [2023-11-29 01:10:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 1106 transitions. [2023-11-29 01:10:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 612. [2023-11-29 01:10:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 370 states have (on average 1.127027027027027) internal successors, (417), 374 states have internal predecessors, (417), 145 states have call successors, (145), 58 states have call predecessors, (145), 97 states have return successors, (420), 179 states have call predecessors, (420), 145 states have call successors, (420) [2023-11-29 01:10:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 982 transitions. [2023-11-29 01:10:58,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 612 states and 982 transitions. [2023-11-29 01:10:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:58,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:10:58,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:10:58,729 INFO L87 Difference]: Start difference. First operand 612 states and 982 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 01:10:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:58,774 INFO L93 Difference]: Finished difference Result 310 states and 549 transitions. [2023-11-29 01:10:58,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 549 transitions. [2023-11-29 01:10:58,779 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 53 [2023-11-29 01:10:58,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 308 states and 547 transitions. [2023-11-29 01:10:58,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2023-11-29 01:10:58,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2023-11-29 01:10:58,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 547 transitions. [2023-11-29 01:10:58,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:58,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 547 transitions. [2023-11-29 01:10:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 547 transitions. [2023-11-29 01:10:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 280. [2023-11-29 01:10:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 170 states have (on average 1.1235294117647059) internal successors, (191), 171 states have internal predecessors, (191), 68 states have call successors, (68), 24 states have call predecessors, (68), 42 states have return successors, (208), 84 states have call predecessors, (208), 68 states have call successors, (208) [2023-11-29 01:10:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 467 transitions. [2023-11-29 01:10:58,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 280 states and 467 transitions. [2023-11-29 01:10:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:10:58,806 INFO L428 stractBuchiCegarLoop]: Abstraction has 280 states and 467 transitions. [2023-11-29 01:10:58,806 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 01:10:58,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 280 states and 467 transitions. [2023-11-29 01:10:58,809 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 45 [2023-11-29 01:10:58,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:58,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:58,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:58,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 01:10:58,810 INFO L748 eck$LassoCheckResult]: Stem: 4595#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4548#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4549#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4567#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 4596#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4640#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4638#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4538#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4539#$Ultimate##0 ~n := #in~n; 4703#L25 assume !(~n <= 0); 4521#L26 call #t~ret0 := fact(~n - 1);< 4555#$Ultimate##0 [2023-11-29 01:10:58,810 INFO L750 eck$LassoCheckResult]: Loop: 4555#$Ultimate##0 ~n := #in~n; 4706#L25 assume !(~n <= 0); 4522#L26 call #t~ret0 := fact(~n - 1);< 4555#$Ultimate##0 [2023-11-29 01:10:58,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 271742545, now seen corresponding path program 1 times [2023-11-29 01:10:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675330235] [2023-11-29 01:10:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:58,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675330235] [2023-11-29 01:10:58,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675330235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:10:58,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:10:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:10:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212679807] [2023-11-29 01:10:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:10:58,881 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:10:58,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2023-11-29 01:10:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:58,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963211694] [2023-11-29 01:10:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:58,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:58,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:58,913 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:58,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:58,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:58,913 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:58,913 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:10:58,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:58,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:58,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2023-11-29 01:10:58,914 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:58,914 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:58,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:58,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:58,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:58,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:58,952 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:58,952 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:10:58,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,954 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-29 01:10:58,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:58,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:58,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:58,975 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:58,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-11-29 01:10:58,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:58,979 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:58,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-11-29 01:10:58,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:58,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:58,998 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:58,999 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:59,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-11-29 01:10:59,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,004 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-11-29 01:10:59,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:59,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:59,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-11-29 01:10:59,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,027 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:10:59,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:59,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-11-29 01:10:59,104 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:10:59,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-11-29 01:10:59,107 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:59,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:59,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:59,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:59,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:10:59,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,107 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:59,107 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:59,107 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2023-11-29 01:10:59,107 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:59,107 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:59,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,130 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:59,130 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:10:59,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,131 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-11-29 01:10:59,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:59,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:59,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:59,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:59,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:59,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:59,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:59,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:59,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:59,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-11-29 01:10:59,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,150 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-11-29 01:10:59,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:59,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:59,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:59,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:59,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:59,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:59,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:59,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:59,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:59,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2023-11-29 01:10:59,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,168 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-11-29 01:10:59,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:59,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:59,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:59,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:59,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:59,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:59,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:59,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:59,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:10:59,186 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:10:59,186 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-29 01:10:59,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,187 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-11-29 01:10:59,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:10:59,189 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:10:59,189 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:10:59,189 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-11-29 01:10:59,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-11-29 01:10:59,192 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:10:59,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:59,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-11-29 01:10:59,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-11-29 01:10:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:10:59,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:10:59,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:10:59,256 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-29 01:10:59,256 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 280 states and 467 transitions. cyclomatic complexity: 194 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:59,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 280 states and 467 transitions. cyclomatic complexity: 194. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 433 states and 726 transitions. Complement of second has 13 states. [2023-11-29 01:10:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 01:10:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2023-11-29 01:10:59,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 11 letters. Loop has 3 letters. [2023-11-29 01:10:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:59,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 14 letters. Loop has 3 letters. [2023-11-29 01:10:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:59,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 11 letters. Loop has 6 letters. [2023-11-29 01:10:59,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:10:59,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 726 transitions. [2023-11-29 01:10:59,313 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2023-11-29 01:10:59,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 409 states and 702 transitions. [2023-11-29 01:10:59,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2023-11-29 01:10:59,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2023-11-29 01:10:59,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 702 transitions. [2023-11-29 01:10:59,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:59,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 409 states and 702 transitions. [2023-11-29 01:10:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 702 transitions. [2023-11-29 01:10:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 401. [2023-11-29 01:10:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 247 states have (on average 1.165991902834008) internal successors, (288), 260 states have internal predecessors, (288), 96 states have call successors, (96), 44 states have call predecessors, (96), 58 states have return successors, (298), 96 states have call predecessors, (298), 96 states have call successors, (298) [2023-11-29 01:10:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 682 transitions. [2023-11-29 01:10:59,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 401 states and 682 transitions. [2023-11-29 01:10:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:10:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:10:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:10:59,345 INFO L87 Difference]: Start difference. First operand 401 states and 682 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:10:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:59,411 INFO L93 Difference]: Finished difference Result 433 states and 758 transitions. [2023-11-29 01:10:59,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 758 transitions. [2023-11-29 01:10:59,419 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 77 [2023-11-29 01:10:59,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 758 transitions. [2023-11-29 01:10:59,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2023-11-29 01:10:59,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2023-11-29 01:10:59,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 758 transitions. [2023-11-29 01:10:59,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:10:59,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 758 transitions. [2023-11-29 01:10:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 758 transitions. [2023-11-29 01:10:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 423. [2023-11-29 01:10:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 257 states have (on average 1.1673151750972763) internal successors, (300), 270 states have internal predecessors, (300), 114 states have call successors, (114), 44 states have call predecessors, (114), 52 states have return successors, (328), 108 states have call predecessors, (328), 114 states have call successors, (328) [2023-11-29 01:10:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 742 transitions. [2023-11-29 01:10:59,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 423 states and 742 transitions. [2023-11-29 01:10:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:10:59,451 INFO L428 stractBuchiCegarLoop]: Abstraction has 423 states and 742 transitions. [2023-11-29 01:10:59,451 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 01:10:59,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 423 states and 742 transitions. [2023-11-29 01:10:59,455 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 77 [2023-11-29 01:10:59,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:10:59,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:10:59,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:10:59,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-29 01:10:59,457 INFO L748 eck$LassoCheckResult]: Stem: 6220#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6167#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6168#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 6188#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 6176#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 6177#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 6193#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 6194#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 6451#$Ultimate##0 ~n := #in~n; 6455#L25 assume ~n <= 0;#res := 1; 6454#factFINAL assume true; 6450#factEXIT >#72#return; 6447#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 6449#$Ultimate##0 ~n := #in~n; 6453#L25 assume !(~n <= 0); 6162#L26 call #t~ret0 := fact(~n - 1);< 6550#$Ultimate##0 ~n := #in~n; 6203#L25 assume ~n <= 0;#res := 1; 6204#factFINAL assume true; 6549#factEXIT >#70#return; 6548#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 6547#factFINAL assume true; 6545#factEXIT >#74#return; 6542#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 6544#$Ultimate##0 ~n := #in~n; 6562#L25 assume !(~n <= 0); 6164#L26 call #t~ret0 := fact(~n - 1);< 6173#$Ultimate##0 [2023-11-29 01:10:59,457 INFO L750 eck$LassoCheckResult]: Loop: 6173#$Ultimate##0 ~n := #in~n; 6557#L25 assume !(~n <= 0); 6163#L26 call #t~ret0 := fact(~n - 1);< 6173#$Ultimate##0 [2023-11-29 01:10:59,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1844396785, now seen corresponding path program 1 times [2023-11-29 01:10:59,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326318999] [2023-11-29 01:10:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:59,464 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:10:59,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652211049] [2023-11-29 01:10:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:59,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:10:59,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,467 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2023-11-29 01:10:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:10:59,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:10:59,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:10:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:10:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326318999] [2023-11-29 01:10:59,609 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:10:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652211049] [2023-11-29 01:10:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652211049] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:10:59,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:59,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-11-29 01:10:59,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156280431] [2023-11-29 01:10:59,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:59,610 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:10:59,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 2 times [2023-11-29 01:10:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:10:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066190234] [2023-11-29 01:10:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:10:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:59,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:10:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:10:59,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:10:59,642 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:59,642 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:59,642 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:59,642 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:59,642 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:10:59,642 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,642 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:59,642 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:59,642 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2023-11-29 01:10:59,642 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:59,643 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:59,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,672 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:59,672 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:10:59,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,674 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-11-29 01:10:59,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:59,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:59,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:10:59,692 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:10:59,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-11-29 01:10:59,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,696 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-11-29 01:10:59,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:10:59,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:59,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2023-11-29 01:10:59,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,713 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-11-29 01:10:59,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:10:59,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:10:59,790 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:10:59,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2023-11-29 01:10:59,793 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:10:59,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:10:59,793 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:10:59,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:10:59,793 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:10:59,793 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,793 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:10:59,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:10:59,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration8_Loop [2023-11-29 01:10:59,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:10:59,794 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:10:59,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:10:59,822 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:10:59,822 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:10:59,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,823 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-11-29 01:10:59,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 [2023-11-29 01:10:59,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:59,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:59,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:59,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:59,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:59,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:59,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:59,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:59,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2023-11-29 01:10:59,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,841 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-11-29 01:10:59,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:59,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:59,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:59,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:59,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:59,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:59,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:59,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:59,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:59,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2023-11-29 01:10:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,858 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-11-29 01:10:59,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:10:59,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:59,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:59,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:59,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:59,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:59,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:59,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:59,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:10:59,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-11-29 01:10:59,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,875 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-11-29 01:10:59,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 [2023-11-29 01:10:59,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:10:59,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:10:59,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:10:59,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:10:59,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:10:59,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:10:59,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:10:59,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:10:59,892 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-11-29 01:10:59,892 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:10:59,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:10:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:10:59,893 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:10:59,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-11-29 01:10:59,895 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:10:59,895 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:10:59,895 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:10:59,895 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-11-29 01:10:59,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-11-29 01:10:59,898 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:10:59,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:59,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:10:59,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:00,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:11:00,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:11:00,126 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-29 01:11:00,126 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:00,218 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 471 states and 800 transitions. Complement of second has 13 states. [2023-11-29 01:11:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 01:11:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2023-11-29 01:11:00,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 27 letters. Loop has 3 letters. [2023-11-29 01:11:00,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:00,220 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 01:11:00,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:00,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:11:00,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:00,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-11-29 01:11:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:00,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:11:00,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:11:00,426 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-29 01:11:00,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:00,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 471 states and 800 transitions. Complement of second has 13 states. [2023-11-29 01:11:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 01:11:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2023-11-29 01:11:00,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 27 letters. Loop has 3 letters. [2023-11-29 01:11:00,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:00,514 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 01:11:00,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:00,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:11:00,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:00,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:11:00,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:11:00,716 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-11-29 01:11:00,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:00,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 423 states and 742 transitions. cyclomatic complexity: 336. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 547 states and 886 transitions. Complement of second has 16 states. [2023-11-29 01:11:00,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 [2023-11-29 01:11:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2023-11-29 01:11:00,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 3 letters. [2023-11-29 01:11:00,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:00,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 3 letters. [2023-11-29 01:11:00,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:00,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 27 letters. Loop has 6 letters. [2023-11-29 01:11:00,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:00,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 547 states and 886 transitions. [2023-11-29 01:11:00,825 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 71 [2023-11-29 01:11:00,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 547 states to 459 states and 798 transitions. [2023-11-29 01:11:00,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2023-11-29 01:11:00,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2023-11-29 01:11:00,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 798 transitions. [2023-11-29 01:11:00,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:00,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 459 states and 798 transitions. [2023-11-29 01:11:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 798 transitions. [2023-11-29 01:11:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 389. [2023-11-29 01:11:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 241 states have (on average 1.161825726141079) internal successors, (280), 246 states have internal predecessors, (280), 100 states have call successors, (100), 38 states have call predecessors, (100), 48 states have return successors, (290), 104 states have call predecessors, (290), 100 states have call successors, (290) [2023-11-29 01:11:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 670 transitions. [2023-11-29 01:11:00,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 389 states and 670 transitions. [2023-11-29 01:11:00,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:00,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:11:00,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:11:00,847 INFO L87 Difference]: Start difference. First operand 389 states and 670 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 01:11:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:00,954 INFO L93 Difference]: Finished difference Result 419 states and 728 transitions. [2023-11-29 01:11:00,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 728 transitions. [2023-11-29 01:11:00,959 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2023-11-29 01:11:00,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 728 transitions. [2023-11-29 01:11:00,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2023-11-29 01:11:00,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2023-11-29 01:11:00,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 728 transitions. [2023-11-29 01:11:00,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:00,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 419 states and 728 transitions. [2023-11-29 01:11:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 728 transitions. [2023-11-29 01:11:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 375. [2023-11-29 01:11:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 227 states have (on average 1.1629955947136563) internal successors, (264), 236 states have internal predecessors, (264), 104 states have call successors, (104), 34 states have call predecessors, (104), 44 states have return successors, (290), 104 states have call predecessors, (290), 104 states have call successors, (290) [2023-11-29 01:11:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 658 transitions. [2023-11-29 01:11:00,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 375 states and 658 transitions. [2023-11-29 01:11:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:11:00,980 INFO L428 stractBuchiCegarLoop]: Abstraction has 375 states and 658 transitions. [2023-11-29 01:11:00,980 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 01:11:00,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 658 transitions. [2023-11-29 01:11:00,983 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 73 [2023-11-29 01:11:00,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:00,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:00,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:00,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:00,984 INFO L748 eck$LassoCheckResult]: Stem: 9448#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9395#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9396#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9418#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 9406#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9408#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9423#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9424#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9728#$Ultimate##0 ~n := #in~n; 9733#L25 assume ~n <= 0;#res := 1; 9731#factFINAL assume true; 9727#factEXIT >#72#return; 9725#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9388#$Ultimate##0 ~n := #in~n; 9730#L25 assume ~n <= 0;#res := 1; 9726#factFINAL assume true; 9724#factEXIT >#74#return; 9387#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9388#$Ultimate##0 ~n := #in~n; 9730#L25 assume ~n <= 0;#res := 1; 9726#factFINAL assume true; 9724#factEXIT >#76#return; 9413#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9414#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 9719#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9506#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 9505#L42-4 havoc main_~k~0#1; 9500#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 9497#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9495#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9488#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9464#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9486#$Ultimate##0 ~n := #in~n; 9682#L25 assume ~n <= 0;#res := 1; 9689#factFINAL assume true; 9688#factEXIT >#72#return; 9521#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#74#return; 9522#L30-2 [2023-11-29 01:11:00,985 INFO L750 eck$LassoCheckResult]: Loop: 9522#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#76#return; 9550#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9686#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 9603#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9596#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9580#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9519#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#72#return; 9510#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9576#$Ultimate##0 ~n := #in~n; 9579#L25 assume ~n <= 0;#res := 1; 9575#factFINAL assume true; 9548#factEXIT >#74#return; 9522#L30-2 [2023-11-29 01:11:00,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1754504676, now seen corresponding path program 2 times [2023-11-29 01:11:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736836245] [2023-11-29 01:11:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:00,992 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994740489] [2023-11-29 01:11:00,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:00,993 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:00,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2023-11-29 01:11:01,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:01,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:01,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:11:01,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 01:11:01,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 01:11:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:01,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736836245] [2023-11-29 01:11:01,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:01,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994740489] [2023-11-29 01:11:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994740489] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:01,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-11-29 01:11:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93510389] [2023-11-29 01:11:01,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:01,174 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:01,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash 430618666, now seen corresponding path program 1 times [2023-11-29 01:11:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:01,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936547794] [2023-11-29 01:11:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:01,178 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660881423] [2023-11-29 01:11:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:01,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:01,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:01,183 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:01,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2023-11-29 01:11:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:01,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:01,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:01,507 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:01,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:01,507 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:01,507 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:01,507 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:11:01,507 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:01,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:01,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:01,508 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2023-11-29 01:11:01,508 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:01,508 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:01,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:01,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:01,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:01,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:01,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:01,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:01,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:01,611 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:01,611 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:11:01,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:01,613 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:01,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-11-29 01:11:01,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:01,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:01,627 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:01,627 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:01,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:01,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:01,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:01,630 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:01,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-11-29 01:11:01,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:01,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:01,644 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:01,644 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: [] [2023-11-29 01:11:01,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:01,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:01,648 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:01,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-11-29 01:11:01,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:01,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:01,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:01,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:01,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:01,670 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:01,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-11-29 01:11:01,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:11:01,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:02,235 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:11:02,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:02,239 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:02,240 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:02,240 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:02,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:02,240 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:11:02,240 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:02,240 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:02,240 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:02,240 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration9_Loop [2023-11-29 01:11:02,240 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:02,240 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:02,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:02,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:02,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:02,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:02,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:02,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:02,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:02,324 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:02,324 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:11:02,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:02,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:02,325 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:02,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-11-29 01:11:02,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:02,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:02,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:02,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:02,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:02,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:02,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:02,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:02,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:02,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:02,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:02,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:02,345 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:02,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-11-29 01:11:02,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:02,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:02,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:02,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:02,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:02,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:02,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:02,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:02,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:02,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2023-11-29 01:11:02,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:02,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:02,363 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:02,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-11-29 01:11:02,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:02,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:02,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:02,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:02,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:02,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:02,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:02,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:02,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:02,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:02,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:02,381 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:02,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2023-11-29 01:11:02,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:02,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:02,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:02,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:02,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:02,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:02,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:02,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:02,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:11:02,403 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-11-29 01:11:02,403 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-11-29 01:11:02,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:02,404 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:02,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-11-29 01:11:02,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:11:02,406 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:11:02,406 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:11:02,406 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 [] [2023-11-29 01:11:02,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:02,409 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:11:02,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:11:02,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:11:02,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:11:02,690 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 [2023-11-29 01:11:02,691 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296 Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:11:02,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Result 871 states and 1264 transitions. Complement of second has 35 states. [2023-11-29 01:11:02,876 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 [2023-11-29 01:11:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:11:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2023-11-29 01:11:02,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 41 letters. Loop has 20 letters. [2023-11-29 01:11:02,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:02,878 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 01:11:02,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:02,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:11:02,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:03,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2023-11-29 01:11:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:11:03,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:11:03,169 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2023-11-29 01:11:03,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296 Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:11:03,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Result 877 states and 1260 transitions. Complement of second has 39 states. [2023-11-29 01:11:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-11-29 01:11:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:11:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2023-11-29 01:11:03,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 60 transitions. Stem has 41 letters. Loop has 20 letters. [2023-11-29 01:11:03,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:03,378 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-29 01:11:03,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:11:03,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:03,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:11:03,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 01:11:03,697 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-11-29 01:11:03,697 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296 Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:11:03,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 375 states and 658 transitions. cyclomatic complexity: 296. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Result 1367 states and 2046 transitions. Complement of second has 64 states. [2023-11-29 01:11:03,966 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 [2023-11-29 01:11:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 01:11:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2023-11-29 01:11:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 41 letters. Loop has 20 letters. [2023-11-29 01:11:03,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:03,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 61 letters. Loop has 20 letters. [2023-11-29 01:11:03,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:03,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 41 letters. Loop has 40 letters. [2023-11-29 01:11:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:03,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1367 states and 2046 transitions. [2023-11-29 01:11:03,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2023-11-29 01:11:04,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1367 states to 1223 states and 1872 transitions. [2023-11-29 01:11:04,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2023-11-29 01:11:04,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2023-11-29 01:11:04,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1223 states and 1872 transitions. [2023-11-29 01:11:04,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:04,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1223 states and 1872 transitions. [2023-11-29 01:11:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states and 1872 transitions. [2023-11-29 01:11:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 997. [2023-11-29 01:11:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 617 states have (on average 1.1474878444084278) internal successors, (708), 630 states have internal predecessors, (708), 234 states have call successors, (258), 118 states have call predecessors, (258), 146 states have return successors, (622), 248 states have call predecessors, (622), 234 states have call successors, (622) [2023-11-29 01:11:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1588 transitions. [2023-11-29 01:11:04,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 997 states and 1588 transitions. [2023-11-29 01:11:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:04,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:11:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:11:04,057 INFO L87 Difference]: Start difference. First operand 997 states and 1588 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 01:11:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:04,244 INFO L93 Difference]: Finished difference Result 1412 states and 2524 transitions. [2023-11-29 01:11:04,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1412 states and 2524 transitions. [2023-11-29 01:11:04,261 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 95 [2023-11-29 01:11:04,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1412 states to 1388 states and 2498 transitions. [2023-11-29 01:11:04,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2023-11-29 01:11:04,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2023-11-29 01:11:04,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1388 states and 2498 transitions. [2023-11-29 01:11:04,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:04,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1388 states and 2498 transitions. [2023-11-29 01:11:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states and 2498 transitions. [2023-11-29 01:11:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 940. [2023-11-29 01:11:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 586 states have (on average 1.1399317406143346) internal successors, (668), 593 states have internal predecessors, (668), 212 states have call successors, (230), 114 states have call predecessors, (230), 142 states have return successors, (552), 232 states have call predecessors, (552), 212 states have call successors, (552) [2023-11-29 01:11:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1450 transitions. [2023-11-29 01:11:04,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 940 states and 1450 transitions. [2023-11-29 01:11:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:11:04,325 INFO L428 stractBuchiCegarLoop]: Abstraction has 940 states and 1450 transitions. [2023-11-29 01:11:04,325 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 01:11:04,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 940 states and 1450 transitions. [2023-11-29 01:11:04,330 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2023-11-29 01:11:04,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:04,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:04,331 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] [2023-11-29 01:11:04,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:04,331 INFO L748 eck$LassoCheckResult]: Stem: 16360#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 16308#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16309#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 16330#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 16317#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16319#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16456#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 16454#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16455#$Ultimate##0 ~n := #in~n; 16458#L25 assume ~n <= 0;#res := 1; 16457#factFINAL assume true; 16453#factEXIT >#72#return; 16446#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16447#$Ultimate##0 ~n := #in~n; 16452#L25 assume ~n <= 0;#res := 1; 16451#factFINAL assume true; 16445#factEXIT >#74#return; 16290#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16435#$Ultimate##0 ~n := #in~n; 16436#L25 assume !(~n <= 0); 16314#L26 call #t~ret0 := fact(~n - 1);< 16315#$Ultimate##0 ~n := #in~n; 16750#L25 assume ~n <= 0;#res := 1; 16763#factFINAL assume true; 16744#factEXIT >#70#return; 16743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16741#factFINAL assume true; 16738#factEXIT >#76#return; 16322#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 16323#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 16331#L42-2 [2023-11-29 01:11:04,332 INFO L750 eck$LassoCheckResult]: Loop: 16331#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16342#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16334#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 16335#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16297#$Ultimate##0 ~n := #in~n; 16625#L25 assume !(~n <= 0); 16403#L26 call #t~ret0 := fact(~n - 1);< 16417#$Ultimate##0 ~n := #in~n; 16420#L25 assume ~n <= 0;#res := 1; 16418#factFINAL assume true; 16402#factEXIT >#70#return; 16411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16734#factFINAL assume true; 16733#factEXIT >#78#return; 16656#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16356#$Ultimate##0 ~n := #in~n; 16658#L25 assume ~n <= 0;#res := 1; 16657#factFINAL assume true; 16655#factEXIT >#80#return; 16616#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16283#$Ultimate##0 ~n := #in~n; 16624#L25 assume !(~n <= 0); 16403#L26 call #t~ret0 := fact(~n - 1);< 16417#$Ultimate##0 ~n := #in~n; 16421#L25 assume !(~n <= 0); 16430#L26 call #t~ret0 := fact(~n - 1);< 16439#$Ultimate##0 ~n := #in~n; 16421#L25 assume !(~n <= 0); 16430#L26 call #t~ret0 := fact(~n - 1);< 16439#$Ultimate##0 ~n := #in~n; 16440#L25 assume ~n <= 0;#res := 1; 16475#factFINAL assume true; 16473#factEXIT >#70#return; 16474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16437#factFINAL assume true; 16438#factEXIT >#70#return; 16432#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16465#factFINAL assume true; 16429#factEXIT >#70#return; 16431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16622#factFINAL assume true; 16754#factEXIT >#82#return; 16310#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 16311#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 16331#L42-2 [2023-11-29 01:11:04,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash 43708250, now seen corresponding path program 1 times [2023-11-29 01:11:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:04,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121813771] [2023-11-29 01:11:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:04,340 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135103296] [2023-11-29 01:11:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:04,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:04,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:04,342 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:04,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2023-11-29 01:11:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:04,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:11:04,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 01:11:04,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 01:11:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:04,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121813771] [2023-11-29 01:11:04,518 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:04,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135103296] [2023-11-29 01:11:04,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135103296] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:04,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:04,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-11-29 01:11:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014599204] [2023-11-29 01:11:04,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:04,519 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:04,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1964428292, now seen corresponding path program 1 times [2023-11-29 01:11:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:04,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098709018] [2023-11-29 01:11:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:04,526 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:04,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764740619] [2023-11-29 01:11:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:04,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:04,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:04,528 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:04,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2023-11-29 01:11:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:04,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:04,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:04,943 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:04,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:04,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:04,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:04,943 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:11:04,943 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:04,943 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:04,943 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:04,943 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-11-29 01:11:04,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:04,943 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:04,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:04,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,007 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:05,007 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:11:05,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,010 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2023-11-29 01:11:05,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:05,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:05,023 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:05,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:05,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,026 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2023-11-29 01:11:05,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:05,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,040 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:05,040 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:05,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-11-29 01:11:05,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,043 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-11-29 01:11:05,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:05,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:05,056 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:05,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:05,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,060 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-11-29 01:11:05,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:05,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,079 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:05,079 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=-2} Honda state: {ULTIMATE.start_main_~n~0#1=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:05,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2023-11-29 01:11:05,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,083 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-11-29 01:11:05,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:05,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,102 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:05,102 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=1} Honda state: {ULTIMATE.start_main_~x~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:05,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2023-11-29 01:11:05,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,105 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-11-29 01:11:05,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:05,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,119 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:05,119 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:05,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2023-11-29 01:11:05,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,122 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-11-29 01:11:05,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:05,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2023-11-29 01:11:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,138 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-11-29 01:11:05,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:11:05,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:05,153 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:11:05,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2023-11-29 01:11:05,155 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:05,155 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:05,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:05,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:05,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:11:05,155 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,155 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:05,155 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:05,155 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-11-29 01:11:05,155 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:05,155 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:05,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:05,214 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:05,214 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:11:05,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,215 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-11-29 01:11:05,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:05,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,233 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-11-29 01:11:05,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:05,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2023-11-29 01:11:05,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,249 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-11-29 01:11:05,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:05,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-11-29 01:11:05,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,266 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-11-29 01:11:05,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:05,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:05,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,285 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-11-29 01:11:05,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:05,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:05,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,306 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-11-29 01:11:05,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:05,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2023-11-29 01:11:05,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,323 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-11-29 01:11:05,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:05,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:05,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,340 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-11-29 01:11:05,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:05,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:05,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:05,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:05,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:05,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:05,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:05,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:05,355 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:11:05,356 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:11:05,357 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:11:05,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:05,358 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:05,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-11-29 01:11:05,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:11:05,359 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:11:05,360 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:11:05,360 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 [] [2023-11-29 01:11:05,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:05,362 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:11:05,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:05,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 01:11:05,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:05,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 01:11:05,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-29 01:11:05,674 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2023-11-29 01:11:05,674 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 940 states and 1450 transitions. cyclomatic complexity: 531 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) [2023-11-29 01:11:05,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 940 states and 1450 transitions. cyclomatic complexity: 531. 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 1818 states and 2540 transitions. Complement of second has 43 states. [2023-11-29 01:11:05,922 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 [2023-11-29 01:11:05,923 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) [2023-11-29 01:11:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2023-11-29 01:11:05,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 73 transitions. Stem has 30 letters. Loop has 44 letters. [2023-11-29 01:11:05,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 73 transitions. Stem has 74 letters. Loop has 44 letters. [2023-11-29 01:11:05,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 73 transitions. Stem has 30 letters. Loop has 88 letters. [2023-11-29 01:11:05,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:05,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1818 states and 2540 transitions. [2023-11-29 01:11:05,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2023-11-29 01:11:05,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1818 states to 1553 states and 2187 transitions. [2023-11-29 01:11:05,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2023-11-29 01:11:05,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2023-11-29 01:11:05,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1553 states and 2187 transitions. [2023-11-29 01:11:05,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:05,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1553 states and 2187 transitions. [2023-11-29 01:11:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states and 2187 transitions. [2023-11-29 01:11:06,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2023-11-29 01:11:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1266. [2023-11-29 01:11:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 826 states have (on average 1.1331719128329298) internal successors, (936), 833 states have internal predecessors, (936), 224 states have call successors, (252), 162 states have call predecessors, (252), 216 states have return successors, (604), 270 states have call predecessors, (604), 224 states have call successors, (604) [2023-11-29 01:11:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1792 transitions. [2023-11-29 01:11:06,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1266 states and 1792 transitions. [2023-11-29 01:11:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:06,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:11:06,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:11:06,045 INFO L87 Difference]: Start difference. First operand 1266 states and 1792 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) [2023-11-29 01:11:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:06,258 INFO L93 Difference]: Finished difference Result 1332 states and 1940 transitions. [2023-11-29 01:11:06,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1332 states and 1940 transitions. [2023-11-29 01:11:06,273 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 73 [2023-11-29 01:11:06,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1332 states to 1240 states and 1812 transitions. [2023-11-29 01:11:06,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2023-11-29 01:11:06,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2023-11-29 01:11:06,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1240 states and 1812 transitions. [2023-11-29 01:11:06,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:06,289 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1240 states and 1812 transitions. [2023-11-29 01:11:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states and 1812 transitions. [2023-11-29 01:11:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1194. [2023-11-29 01:11:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 770 states have (on average 1.1168831168831168) internal successors, (860), 771 states have internal predecessors, (860), 236 states have call successors, (266), 148 states have call predecessors, (266), 188 states have return successors, (628), 274 states have call predecessors, (628), 236 states have call successors, (628) [2023-11-29 01:11:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1754 transitions. [2023-11-29 01:11:06,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1194 states and 1754 transitions. [2023-11-29 01:11:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:11:06,335 INFO L428 stractBuchiCegarLoop]: Abstraction has 1194 states and 1754 transitions. [2023-11-29 01:11:06,335 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 01:11:06,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1194 states and 1754 transitions. [2023-11-29 01:11:06,343 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 73 [2023-11-29 01:11:06,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:06,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:06,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:06,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:06,344 INFO L748 eck$LassoCheckResult]: Stem: 22206#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 22147#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 22148#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 22175#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 22162#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22164#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22180#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22136#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22137#$Ultimate##0 ~n := #in~n; 22679#L25 assume ~n <= 0;#res := 1; 22677#factFINAL assume true; 22675#factEXIT >#72#return; 22193#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22194#$Ultimate##0 ~n := #in~n; 22587#L25 assume ~n <= 0;#res := 1; 22586#factFINAL assume true; 22579#factEXIT >#74#return; 22421#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22573#$Ultimate##0 ~n := #in~n; 22657#L25 assume ~n <= 0;#res := 1; 22658#factFINAL assume true; 22420#factEXIT >#76#return; 22422#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22415#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22416#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22413#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22412#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22122#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22123#$Ultimate##0 ~n := #in~n; 22603#L25 assume !(~n <= 0); 22439#L26 call #t~ret0 := fact(~n - 1);< 22156#$Ultimate##0 ~n := #in~n; 22699#L25 assume !(~n <= 0); 22127#L26 call #t~ret0 := fact(~n - 1);< 22683#$Ultimate##0 ~n := #in~n; 22189#L25 assume ~n <= 0;#res := 1; 22190#factFINAL assume true; 22126#factEXIT >#70#return; 22128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22682#factFINAL assume true; 22437#factEXIT >#70#return; 22441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22826#factFINAL assume true; 22663#factEXIT >#78#return; 22401#L30-6 [2023-11-29 01:11:06,345 INFO L750 eck$LassoCheckResult]: Loop: 22401#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22402#$Ultimate##0 ~n := #in~n; 22477#L25 assume ~n <= 0;#res := 1; 22406#factFINAL assume true; 22408#factEXIT >#80#return; 22430#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22123#$Ultimate##0 ~n := #in~n; 22603#L25 assume !(~n <= 0); 22439#L26 call #t~ret0 := fact(~n - 1);< 22156#$Ultimate##0 ~n := #in~n; 22699#L25 assume !(~n <= 0); 22127#L26 call #t~ret0 := fact(~n - 1);< 22683#$Ultimate##0 ~n := #in~n; 22699#L25 assume !(~n <= 0); 22127#L26 call #t~ret0 := fact(~n - 1);< 22683#$Ultimate##0 ~n := #in~n; 22189#L25 assume ~n <= 0;#res := 1; 22190#factFINAL assume true; 22126#factEXIT >#70#return; 22128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22682#factFINAL assume true; 22437#factEXIT >#70#return; 22440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22700#factFINAL assume true; 22698#factEXIT >#70#return; 22697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22696#factFINAL assume true; 22695#factEXIT >#82#return; 22149#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 22150#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 22425#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22186#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22187#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 22279#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22402#$Ultimate##0 ~n := #in~n; 22477#L25 assume !(~n <= 0); 22439#L26 call #t~ret0 := fact(~n - 1);< 22156#$Ultimate##0 ~n := #in~n; 22699#L25 assume !(~n <= 0); 22127#L26 call #t~ret0 := fact(~n - 1);< 22683#$Ultimate##0 ~n := #in~n; 22189#L25 assume ~n <= 0;#res := 1; 22190#factFINAL assume true; 22126#factEXIT >#70#return; 22128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22682#factFINAL assume true; 22437#factEXIT >#70#return; 22441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22826#factFINAL assume true; 22663#factEXIT >#78#return; 22401#L30-6 [2023-11-29 01:11:06,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1202027697, now seen corresponding path program 1 times [2023-11-29 01:11:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205274693] [2023-11-29 01:11:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:06,352 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143873540] [2023-11-29 01:11:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:06,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:06,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:06,355 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:06,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2023-11-29 01:11:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:06,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:11:06,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 01:11:06,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 01:11:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:06,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205274693] [2023-11-29 01:11:06,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:06,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143873540] [2023-11-29 01:11:06,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143873540] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:06,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2023-11-29 01:11:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963456988] [2023-11-29 01:11:06,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:06,613 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:06,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 433142716, now seen corresponding path program 2 times [2023-11-29 01:11:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:06,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605909699] [2023-11-29 01:11:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:06,619 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279539575] [2023-11-29 01:11:06,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:06,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:06,621 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:06,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2023-11-29 01:11:06,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:06,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:06,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:06,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:07,071 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:07,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:07,071 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:07,071 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:07,071 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:11:07,071 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,071 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:07,071 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:07,071 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-11-29 01:11:07,071 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:07,071 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:07,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:07,155 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:11:07,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,156 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-11-29 01:11:07,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:07,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:07,170 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:07,170 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:07,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,173 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-11-29 01:11:07,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:07,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:07,187 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:07,187 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:07,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:07,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,190 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-11-29 01:11:07,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:07,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:07,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2023-11-29 01:11:07,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,207 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-11-29 01:11:07,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:11:07,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:07,222 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:11:07,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2023-11-29 01:11:07,224 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:07,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:07,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:07,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:07,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:11:07,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:07,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:07,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-11-29 01:11:07,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:07,225 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:07,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:07,305 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:07,305 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:11:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,306 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-11-29 01:11:07,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:07,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:07,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:07,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:07,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:07,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:07,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:07,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:07,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:07,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2023-11-29 01:11:07,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,323 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-11-29 01:11:07,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:07,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:07,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:07,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:07,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:07,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:07,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:07,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:07,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:07,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2023-11-29 01:11:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,340 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-11-29 01:11:07,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:07,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:07,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:07,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:07,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:07,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:07,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:07,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:07,355 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:11:07,357 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:11:07,357 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:11:07,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:07,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:07,358 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:07,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-11-29 01:11:07,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:11:07,360 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:11:07,360 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:11:07,360 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2023-11-29 01:11:07,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2023-11-29 01:11:07,363 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:11:07,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:07,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:11:07,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:07,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 01:11:07,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 57 proven. 7 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 01:11:07,769 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2023-11-29 01:11:07,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1194 states and 1754 transitions. cyclomatic complexity: 586 Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-29 01:11:07,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2023-11-29 01:11:08,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1194 states and 1754 transitions. cyclomatic complexity: 586. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Result 2609 states and 3548 transitions. Complement of second has 51 states. [2023-11-29 01:11:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-11-29 01:11:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-29 01:11:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2023-11-29 01:11:08,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 85 transitions. Stem has 44 letters. Loop has 50 letters. [2023-11-29 01:11:08,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:08,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 85 transitions. Stem has 94 letters. Loop has 50 letters. [2023-11-29 01:11:08,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:08,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 85 transitions. Stem has 44 letters. Loop has 100 letters. [2023-11-29 01:11:08,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:08,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2609 states and 3548 transitions. [2023-11-29 01:11:08,065 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 72 [2023-11-29 01:11:08,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2609 states to 2108 states and 2893 transitions. [2023-11-29 01:11:08,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2023-11-29 01:11:08,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 392 [2023-11-29 01:11:08,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2108 states and 2893 transitions. [2023-11-29 01:11:08,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:08,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2108 states and 2893 transitions. [2023-11-29 01:11:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states and 2893 transitions. [2023-11-29 01:11:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1731. [2023-11-29 01:11:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1121 states have (on average 1.1177520071364853) internal successors, (1253), 1144 states have internal predecessors, (1253), 305 states have call successors, (354), 212 states have call predecessors, (354), 305 states have return successors, (817), 374 states have call predecessors, (817), 305 states have call successors, (817) [2023-11-29 01:11:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2424 transitions. [2023-11-29 01:11:08,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1731 states and 2424 transitions. [2023-11-29 01:11:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:11:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:11:08,132 INFO L87 Difference]: Start difference. First operand 1731 states and 2424 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 01:11:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:08,352 INFO L93 Difference]: Finished difference Result 2110 states and 3065 transitions. [2023-11-29 01:11:08,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2110 states and 3065 transitions. [2023-11-29 01:11:08,368 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 91 [2023-11-29 01:11:08,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2110 states to 2104 states and 3057 transitions. [2023-11-29 01:11:08,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2023-11-29 01:11:08,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2023-11-29 01:11:08,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2104 states and 3057 transitions. [2023-11-29 01:11:08,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:08,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2104 states and 3057 transitions. [2023-11-29 01:11:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states and 3057 transitions. [2023-11-29 01:11:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1785. [2023-11-29 01:11:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1165 states have (on average 1.1184549356223177) internal successors, (1303), 1190 states have internal predecessors, (1303), 315 states have call successors, (364), 212 states have call predecessors, (364), 305 states have return successors, (831), 382 states have call predecessors, (831), 315 states have call successors, (831) [2023-11-29 01:11:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2498 transitions. [2023-11-29 01:11:08,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1785 states and 2498 transitions. [2023-11-29 01:11:08,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:11:08,440 INFO L428 stractBuchiCegarLoop]: Abstraction has 1785 states and 2498 transitions. [2023-11-29 01:11:08,440 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 01:11:08,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1785 states and 2498 transitions. [2023-11-29 01:11:08,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 [2023-11-29 01:11:08,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:08,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:08,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:08,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:08,463 INFO L748 eck$LassoCheckResult]: Stem: 30488#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 30429#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 30430#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 30456#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 30445#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 30447#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30460#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30461#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30832#$Ultimate##0 ~n := #in~n; 30837#L25 assume ~n <= 0;#res := 1; 30835#factFINAL assume true; 30831#factEXIT >#72#return; 30827#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30828#$Ultimate##0 ~n := #in~n; 30834#L25 assume ~n <= 0;#res := 1; 30830#factFINAL assume true; 30826#factEXIT >#74#return; 30817#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30818#$Ultimate##0 ~n := #in~n; 31179#L25 assume ~n <= 0;#res := 1; 31178#factFINAL assume true; 31177#factEXIT >#76#return; 31176#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 31175#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 31174#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 31166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31167#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 31151#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31153#$Ultimate##0 ~n := #in~n; 31189#L25 assume ~n <= 0;#res := 1; 31190#factFINAL assume true; 31150#factEXIT >#78#return; 30786#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31058#$Ultimate##0 ~n := #in~n; 31233#L25 assume ~n <= 0;#res := 1; 31232#factFINAL assume true; 30785#factEXIT >#80#return; 30436#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30798#$Ultimate##0 ~n := #in~n; 31356#L25 assume !(~n <= 0); 30435#L26 call #t~ret0 := fact(~n - 1);< 30437#$Ultimate##0 ~n := #in~n; 30908#L25 assume ~n <= 0;#res := 1; 30952#factFINAL assume true; 30951#factEXIT >#70#return; 30847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30797#factFINAL assume true; 30773#factEXIT >#82#return; 30431#L30-8 [2023-11-29 01:11:08,463 INFO L750 eck$LassoCheckResult]: Loop: 30431#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 30432#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 30770#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30771#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30748#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 30749#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30789#$Ultimate##0 ~n := #in~n; 30868#L25 assume !(~n <= 0); 30844#L26 call #t~ret0 := fact(~n - 1);< 30437#$Ultimate##0 ~n := #in~n; 30906#L25 assume !(~n <= 0); 30843#L26 call #t~ret0 := fact(~n - 1);< 30904#$Ultimate##0 ~n := #in~n; 30906#L25 assume !(~n <= 0); 30843#L26 call #t~ret0 := fact(~n - 1);< 30904#$Ultimate##0 ~n := #in~n; 30907#L25 assume ~n <= 0;#res := 1; 30927#factFINAL assume true; 30920#factEXIT >#70#return; 30919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30915#factFINAL assume true; 30840#factEXIT >#70#return; 30846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30903#factFINAL assume true; 30902#factEXIT >#70#return; 30899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30896#factFINAL assume true; 30815#factEXIT >#78#return; 30783#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 30789#$Ultimate##0 ~n := #in~n; 30868#L25 assume ~n <= 0;#res := 1; 30867#factFINAL assume true; 30803#factEXIT >#80#return; 30774#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 30775#$Ultimate##0 ~n := #in~n; 30905#L25 assume !(~n <= 0); 30844#L26 call #t~ret0 := fact(~n - 1);< 30437#$Ultimate##0 ~n := #in~n; 30908#L25 assume ~n <= 0;#res := 1; 30952#factFINAL assume true; 30951#factEXIT >#70#return; 30848#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31034#factFINAL assume true; 30782#factEXIT >#82#return; 30431#L30-8 [2023-11-29 01:11:08,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 248376115, now seen corresponding path program 1 times [2023-11-29 01:11:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612039248] [2023-11-29 01:11:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:08,471 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:08,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713095024] [2023-11-29 01:11:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:08,473 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:08,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2023-11-29 01:11:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:08,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:11:08,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 01:11:08,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:11:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612039248] [2023-11-29 01:11:08,572 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:08,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713095024] [2023-11-29 01:11:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713095024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:11:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:11:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:11:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665159264] [2023-11-29 01:11:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:11:08,573 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:08,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:08,574 INFO L85 PathProgramCache]: Analyzing trace with hash 627588028, now seen corresponding path program 3 times [2023-11-29 01:11:08,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:08,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023386096] [2023-11-29 01:11:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:08,578 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:08,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43155046] [2023-11-29 01:11:08,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:11:08,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:08,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:08,580 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:08,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2023-11-29 01:11:08,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 01:11:08,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:08,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:11:08,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 01:11:08,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 23 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 01:11:09,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:09,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023386096] [2023-11-29 01:11:09,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:09,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43155046] [2023-11-29 01:11:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43155046] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:09,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:09,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2023-11-29 01:11:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313595221] [2023-11-29 01:11:09,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:09,125 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:09,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:11:09,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:11:09,125 INFO L87 Difference]: Start difference. First operand 1785 states and 2498 transitions. cyclomatic complexity: 753 Second operand has 18 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 01:11:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:09,663 INFO L93 Difference]: Finished difference Result 2960 states and 4342 transitions. [2023-11-29 01:11:09,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2960 states and 4342 transitions. [2023-11-29 01:11:09,681 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 182 [2023-11-29 01:11:09,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2960 states to 2903 states and 4267 transitions. [2023-11-29 01:11:09,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 592 [2023-11-29 01:11:09,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 592 [2023-11-29 01:11:09,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2903 states and 4267 transitions. [2023-11-29 01:11:09,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:09,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2903 states and 4267 transitions. [2023-11-29 01:11:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states and 4267 transitions. [2023-11-29 01:11:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2272. [2023-11-29 01:11:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1439 states have (on average 1.0958999305072967) internal successors, (1577), 1458 states have internal predecessors, (1577), 474 states have call successors, (527), 307 states have call predecessors, (527), 359 states have return successors, (1160), 506 states have call predecessors, (1160), 474 states have call successors, (1160) [2023-11-29 01:11:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3264 transitions. [2023-11-29 01:11:09,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2272 states and 3264 transitions. [2023-11-29 01:11:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:11:09,799 INFO L428 stractBuchiCegarLoop]: Abstraction has 2272 states and 3264 transitions. [2023-11-29 01:11:09,799 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 01:11:09,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2272 states and 3264 transitions. [2023-11-29 01:11:09,807 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2023-11-29 01:11:09,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:09,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:09,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:09,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:09,808 INFO L748 eck$LassoCheckResult]: Stem: 35684#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 35621#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 35622#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 35645#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 35685#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 35708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35709#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 35765#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35766#$Ultimate##0 ~n := #in~n; 35769#L25 assume ~n <= 0;#res := 1; 35768#factFINAL assume true; 35764#factEXIT >#72#return; 35760#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35761#$Ultimate##0 ~n := #in~n; 35767#L25 assume ~n <= 0;#res := 1; 35763#factFINAL assume true; 35759#factEXIT >#74#return; 35751#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35755#$Ultimate##0 ~n := #in~n; 35762#L25 assume ~n <= 0;#res := 1; 35758#factFINAL assume true; 35750#factEXIT >#76#return; 35752#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 36688#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 36687#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 36686#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 36685#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 36370#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 36371#$Ultimate##0 ~n := #in~n; 36396#L25 assume ~n <= 0;#res := 1; 36395#factFINAL assume true; 36369#factEXIT >#78#return; 36216#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 36363#$Ultimate##0 ~n := #in~n; 36719#L25 assume ~n <= 0;#res := 1; 36716#factFINAL assume true; 36712#factEXIT >#80#return; 36186#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36276#$Ultimate##0 ~n := #in~n; 36213#L25 assume !(~n <= 0); 36006#L26 call #t~ret0 := fact(~n - 1);< 36184#$Ultimate##0 ~n := #in~n; 36187#L25 assume ~n <= 0;#res := 1; 36185#factFINAL assume true; 36181#factEXIT >#70#return; 36182#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36790#factFINAL assume true; 36787#factEXIT >#82#return; 35999#L30-8 [2023-11-29 01:11:09,809 INFO L750 eck$LassoCheckResult]: Loop: 35999#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 35719#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 35717#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35718#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35703#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 35704#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35993#$Ultimate##0 ~n := #in~n; 36188#L25 assume !(~n <= 0); 36007#L26 call #t~ret0 := fact(~n - 1);< 36184#$Ultimate##0 ~n := #in~n; 36067#L25 assume !(~n <= 0); 36008#L26 call #t~ret0 := fact(~n - 1);< 36065#$Ultimate##0 ~n := #in~n; 36067#L25 assume !(~n <= 0); 36008#L26 call #t~ret0 := fact(~n - 1);< 36065#$Ultimate##0 ~n := #in~n; 36068#L25 assume ~n <= 0;#res := 1; 36066#factFINAL assume true; 36064#factEXIT >#70#return; 36063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36060#factFINAL assume true; 36057#factEXIT >#70#return; 36015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36047#factFINAL assume true; 36002#factEXIT >#70#return; 36001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36000#factFINAL assume true; 35996#factEXIT >#78#return; 35992#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35993#$Ultimate##0 ~n := #in~n; 36188#L25 assume ~n <= 0;#res := 1; 36749#factFINAL assume true; 36748#factEXIT >#80#return; 35994#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35995#$Ultimate##0 ~n := #in~n; 36747#L25 assume !(~n <= 0); 36010#L26 call #t~ret0 := fact(~n - 1);< 36017#$Ultimate##0 ~n := #in~n; 36056#L25 assume !(~n <= 0); 36011#L26 call #t~ret0 := fact(~n - 1);< 36049#$Ultimate##0 ~n := #in~n; 36067#L25 assume !(~n <= 0); 36008#L26 call #t~ret0 := fact(~n - 1);< 36065#$Ultimate##0 ~n := #in~n; 36068#L25 assume ~n <= 0;#res := 1; 36066#factFINAL assume true; 36064#factEXIT >#70#return; 36063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36060#factFINAL assume true; 36057#factEXIT >#70#return; 36015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36047#factFINAL assume true; 36002#factEXIT >#70#return; 36001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36000#factFINAL assume true; 35996#factEXIT >#82#return; 35999#L30-8 [2023-11-29 01:11:09,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:09,809 INFO L85 PathProgramCache]: Analyzing trace with hash 248376115, now seen corresponding path program 2 times [2023-11-29 01:11:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912669474] [2023-11-29 01:11:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:09,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:09,814 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:09,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789203407] [2023-11-29 01:11:09,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:09,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:09,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:09,818 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:09,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2023-11-29 01:11:09,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:09,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:09,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:11:09,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 01:11:09,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:11:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912669474] [2023-11-29 01:11:09,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789203407] [2023-11-29 01:11:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789203407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:11:09,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:11:09,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:11:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475387740] [2023-11-29 01:11:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:11:09,911 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:09,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:09,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1512254596, now seen corresponding path program 4 times [2023-11-29 01:11:09,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:09,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834446023] [2023-11-29 01:11:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:09,915 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081267431] [2023-11-29 01:11:09,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:11:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:09,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:09,918 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:09,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2023-11-29 01:11:09,976 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:11:09,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:09,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:09,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:10,418 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:10,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:10,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:10,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:10,419 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:11:10,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:10,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:10,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-11-29 01:11:10,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:10,419 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:10,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,499 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:10,500 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:11:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,501 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-11-29 01:11:10,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:10,515 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=6} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:10,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-11-29 01:11:10,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,518 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-11-29 01:11:10,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:10,532 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:10,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-11-29 01:11:10,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,535 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-11-29 01:11:10,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:10,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:10,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2023-11-29 01:11:10,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,552 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-11-29 01:11:10,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:10,566 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=3} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:10,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2023-11-29 01:11:10,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,569 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-11-29 01:11:10,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:10,583 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:10,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:10,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,587 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-11-29 01:11:10,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,601 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:10,601 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:10,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2023-11-29 01:11:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,605 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-11-29 01:11:10,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:10,624 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=3} Honda state: {ULTIMATE.start_main_~x~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:10,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2023-11-29 01:11:10,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,627 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-11-29 01:11:10,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:10,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2023-11-29 01:11:10,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,650 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-11-29 01:11:10,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:11:10,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:10,665 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:11:10,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2023-11-29 01:11:10,667 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:10,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:10,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:10,668 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:10,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:11:10,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:10,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:10,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-11-29 01:11:10,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:10,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:10,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:10,748 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:10,748 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:11:10,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,749 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-11-29 01:11:10,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:10,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:10,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2023-11-29 01:11:10,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,767 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-11-29 01:11:10,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:10,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:10,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2023-11-29 01:11:10,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,786 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-11-29 01:11:10,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 [2023-11-29 01:11:10,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:10,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2023-11-29 01:11:10,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,812 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-11-29 01:11:10,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:10,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:10,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2023-11-29 01:11:10,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,829 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2023-11-29 01:11:10,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:10,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:10,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2023-11-29 01:11:10,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,847 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-11-29 01:11:10,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:10,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:10,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2023-11-29 01:11:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,865 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-11-29 01:11:10,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 [2023-11-29 01:11:10,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:10,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2023-11-29 01:11:10,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,883 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2023-11-29 01:11:10,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:10,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:10,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:10,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:10,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:10,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:10,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:10,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:10,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:11:10,900 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:11:10,900 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:11:10,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:10,901 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:10,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2023-11-29 01:11:10,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:11:10,903 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:11:10,903 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:11:10,903 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 5 Supporting invariants [] [2023-11-29 01:11:10,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2023-11-29 01:11:10,906 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:11:10,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:10,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 01:11:10,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:11,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 01:11:11,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-29 01:11:11,349 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2023-11-29 01:11:11,349 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2272 states and 3264 transitions. cyclomatic complexity: 1032 Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 01:11:11,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2272 states and 3264 transitions. cyclomatic complexity: 1032. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Result 5231 states and 7589 transitions. Complement of second has 59 states. [2023-11-29 01:11:11,645 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 [2023-11-29 01:11:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 01:11:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2023-11-29 01:11:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 99 transitions. Stem has 48 letters. Loop has 56 letters. [2023-11-29 01:11:11,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:11,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 99 transitions. Stem has 104 letters. Loop has 56 letters. [2023-11-29 01:11:11,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:11,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 99 transitions. Stem has 48 letters. Loop has 112 letters. [2023-11-29 01:11:11,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:11,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5231 states and 7589 transitions. [2023-11-29 01:11:11,673 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2023-11-29 01:11:11,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:11,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5231 states to 3945 states and 5725 transitions. [2023-11-29 01:11:11,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 575 [2023-11-29 01:11:11,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 579 [2023-11-29 01:11:11,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3945 states and 5725 transitions. [2023-11-29 01:11:11,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:11,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3945 states and 5725 transitions. [2023-11-29 01:11:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states and 5725 transitions. [2023-11-29 01:11:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3528. [2023-11-29 01:11:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 2220 states have (on average 1.0887387387387388) internal successors, (2417), 2258 states have internal predecessors, (2417), 711 states have call successors, (785), 483 states have call predecessors, (785), 597 states have return successors, (1907), 786 states have call predecessors, (1907), 711 states have call successors, (1907) [2023-11-29 01:11:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 5109 transitions. [2023-11-29 01:11:11,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3528 states and 5109 transitions. [2023-11-29 01:11:11,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:11:11,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:11:11,824 INFO L87 Difference]: Start difference. First operand 3528 states and 5109 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2023-11-29 01:11:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:11,909 INFO L93 Difference]: Finished difference Result 3299 states and 4764 transitions. [2023-11-29 01:11:11,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3299 states and 4764 transitions. [2023-11-29 01:11:11,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2023-11-29 01:11:11,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3299 states to 3291 states and 4756 transitions. [2023-11-29 01:11:11,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2023-11-29 01:11:11,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2023-11-29 01:11:11,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3291 states and 4756 transitions. [2023-11-29 01:11:11,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:11,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3291 states and 4756 transitions. [2023-11-29 01:11:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states and 4756 transitions. [2023-11-29 01:11:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3181. [2023-11-29 01:11:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 1995 states have (on average 1.0892230576441102) internal successors, (2173), 2020 states have internal predecessors, (2173), 661 states have call successors, (712), 425 states have call predecessors, (712), 525 states have return successors, (1729), 735 states have call predecessors, (1729), 661 states have call successors, (1729) [2023-11-29 01:11:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4614 transitions. [2023-11-29 01:11:12,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3181 states and 4614 transitions. [2023-11-29 01:11:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:11:12,022 INFO L428 stractBuchiCegarLoop]: Abstraction has 3181 states and 4614 transitions. [2023-11-29 01:11:12,022 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 01:11:12,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3181 states and 4614 transitions. [2023-11-29 01:11:12,041 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 96 [2023-11-29 01:11:12,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:12,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:12,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:12,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:12,043 INFO L748 eck$LassoCheckResult]: Stem: 50569#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 50507#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 50508#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 50532#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 50519#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 50521#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50833#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 50503#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50504#$Ultimate##0 ~n := #in~n; 51148#L25 assume ~n <= 0;#res := 1; 51144#factFINAL assume true; 51143#factEXIT >#72#return; 50551#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50552#$Ultimate##0 ~n := #in~n; 51121#L25 assume ~n <= 0;#res := 1; 51120#factFINAL assume true; 51119#factEXIT >#74#return; 50493#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50494#$Ultimate##0 ~n := #in~n; 51141#L25 assume ~n <= 0;#res := 1; 51140#factFINAL assume true; 51138#factEXIT >#76#return; 50524#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50525#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 50545#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50568#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52352#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 52334#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52336#$Ultimate##0 ~n := #in~n; 52346#L25 assume !(~n <= 0); 52341#L26 call #t~ret0 := fact(~n - 1);< 52344#$Ultimate##0 ~n := #in~n; 52347#L25 assume ~n <= 0;#res := 1; 52345#factFINAL assume true; 52340#factEXIT >#70#return; 52339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52338#factFINAL assume true; 52333#factEXIT >#78#return; 50560#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52329#$Ultimate##0 ~n := #in~n; 52337#L25 assume ~n <= 0;#res := 1; 52332#factFINAL assume true; 52328#factEXIT >#80#return; 50570#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 50571#$Ultimate##0 ~n := #in~n; 52419#L25 assume !(~n <= 0); 50500#L26 call #t~ret0 := fact(~n - 1);< 52395#$Ultimate##0 ~n := #in~n; 50546#L25 assume ~n <= 0;#res := 1; 50498#factFINAL assume true; 50501#factEXIT >#70#return; 52251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52246#factFINAL assume true; 51136#factEXIT >#82#return; 51137#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50510#binomialCoefficient_returnLabel#2 [2023-11-29 01:11:12,043 INFO L750 eck$LassoCheckResult]: Loop: 50510#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 50533#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 50548#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 50549#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 50483#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 50484#$Ultimate##0 ~n := #in~n; 51501#L25 assume !(~n <= 0); 51433#L26 call #t~ret0 := fact(~n - 1);< 52179#$Ultimate##0 ~n := #in~n; 51485#L25 assume !(~n <= 0); 51440#L26 call #t~ret0 := fact(~n - 1);< 51477#$Ultimate##0 ~n := #in~n; 51485#L25 assume !(~n <= 0); 51440#L26 call #t~ret0 := fact(~n - 1);< 51477#$Ultimate##0 ~n := #in~n; 51485#L25 assume !(~n <= 0); 51440#L26 call #t~ret0 := fact(~n - 1);< 51477#$Ultimate##0 ~n := #in~n; 51482#L25 assume ~n <= 0;#res := 1; 51478#factFINAL assume true; 51476#factEXIT >#70#return; 51474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51470#factFINAL assume true; 51467#factEXIT >#70#return; 51454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51453#factFINAL assume true; 51451#factEXIT >#70#return; 51445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51448#factFINAL assume true; 51428#factEXIT >#70#return; 51427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51425#factFINAL assume true; 51419#factEXIT >#78#return; 51421#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 50484#$Ultimate##0 ~n := #in~n; 51501#L25 assume !(~n <= 0); 51433#L26 call #t~ret0 := fact(~n - 1);< 52179#$Ultimate##0 ~n := #in~n; 52193#L25 assume ~n <= 0;#res := 1; 52180#factFINAL assume true; 52173#factEXIT >#70#return; 52177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52233#factFINAL assume true; 51567#factEXIT >#80#return; 51420#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51426#$Ultimate##0 ~n := #in~n; 52227#L25 assume !(~n <= 0); 51438#L26 call #t~ret0 := fact(~n - 1);< 51472#$Ultimate##0 ~n := #in~n; 51485#L25 assume !(~n <= 0); 51440#L26 call #t~ret0 := fact(~n - 1);< 51477#$Ultimate##0 ~n := #in~n; 51485#L25 assume !(~n <= 0); 51440#L26 call #t~ret0 := fact(~n - 1);< 51477#$Ultimate##0 ~n := #in~n; 51485#L25 assume !(~n <= 0); 51440#L26 call #t~ret0 := fact(~n - 1);< 51477#$Ultimate##0 ~n := #in~n; 51482#L25 assume ~n <= 0;#res := 1; 51478#factFINAL assume true; 51476#factEXIT >#70#return; 51474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51470#factFINAL assume true; 51467#factEXIT >#70#return; 51454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51453#factFINAL assume true; 51451#factEXIT >#70#return; 51445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51448#factFINAL assume true; 51428#factEXIT >#70#return; 51427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51425#factFINAL assume true; 51419#factEXIT >#82#return; 50509#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 50510#binomialCoefficient_returnLabel#2 [2023-11-29 01:11:12,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash -453366944, now seen corresponding path program 1 times [2023-11-29 01:11:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373605632] [2023-11-29 01:11:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:12,050 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928879661] [2023-11-29 01:11:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:12,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:12,051 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:12,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2023-11-29 01:11:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:12,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:12,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:12,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash 618558118, now seen corresponding path program 5 times [2023-11-29 01:11:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:12,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047310819] [2023-11-29 01:11:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:12,152 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849103825] [2023-11-29 01:11:12,152 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:11:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:12,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:12,155 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:12,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2023-11-29 01:11:12,228 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2023-11-29 01:11:12,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:12,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 01:11:12,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 49 proven. 185 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-29 01:11:12,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 49 proven. 213 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 01:11:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047310819] [2023-11-29 01:11:13,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:13,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849103825] [2023-11-29 01:11:13,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849103825] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:13,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:13,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 25 [2023-11-29 01:11:13,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926316106] [2023-11-29 01:11:13,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:13,299 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:13,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 01:11:13,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-11-29 01:11:13,300 INFO L87 Difference]: Start difference. First operand 3181 states and 4614 transitions. cyclomatic complexity: 1485 Second operand has 25 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 14 states have call successors, (20) [2023-11-29 01:11:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:13,925 INFO L93 Difference]: Finished difference Result 5341 states and 8689 transitions. [2023-11-29 01:11:13,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5341 states and 8689 transitions. [2023-11-29 01:11:13,953 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2023-11-29 01:11:14,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5341 states to 5317 states and 8665 transitions. [2023-11-29 01:11:14,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 843 [2023-11-29 01:11:14,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 861 [2023-11-29 01:11:14,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5317 states and 8665 transitions. [2023-11-29 01:11:14,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:14,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5317 states and 8665 transitions. [2023-11-29 01:11:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states and 8665 transitions. [2023-11-29 01:11:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 4047. [2023-11-29 01:11:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4047 states, 2509 states have (on average 1.0924671183738541) internal successors, (2741), 2490 states have internal predecessors, (2741), 901 states have call successors, (954), 596 states have call predecessors, (954), 637 states have return successors, (2987), 960 states have call predecessors, (2987), 901 states have call successors, (2987) [2023-11-29 01:11:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 6682 transitions. [2023-11-29 01:11:14,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4047 states and 6682 transitions. [2023-11-29 01:11:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:11:14,205 INFO L428 stractBuchiCegarLoop]: Abstraction has 4047 states and 6682 transitions. [2023-11-29 01:11:14,206 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-29 01:11:14,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4047 states and 6682 transitions. [2023-11-29 01:11:14,227 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 115 [2023-11-29 01:11:14,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:14,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:14,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:14,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:14,229 INFO L748 eck$LassoCheckResult]: Stem: 59587#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 59531#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 59532#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 59554#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 59541#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 59543#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 59876#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 59527#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 59528#$Ultimate##0 ~n := #in~n; 59878#L25 assume ~n <= 0;#res := 1; 59877#factFINAL assume true; 59875#factEXIT >#72#return; 59573#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 59574#$Ultimate##0 ~n := #in~n; 60076#L25 assume ~n <= 0;#res := 1; 60059#factFINAL assume true; 60000#factEXIT >#74#return; 59996#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 59997#$Ultimate##0 ~n := #in~n; 60061#L25 assume ~n <= 0;#res := 1; 60005#factFINAL assume true; 59995#factEXIT >#76#return; 59993#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 59972#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 59585#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 59586#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61882#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 61863#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61865#$Ultimate##0 ~n := #in~n; 61873#L25 assume !(~n <= 0); 61870#L26 call #t~ret0 := fact(~n - 1);< 61872#$Ultimate##0 ~n := #in~n; 61877#L25 assume ~n <= 0;#res := 1; 61875#factFINAL assume true; 61868#factEXIT >#70#return; 61867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61866#factFINAL assume true; 61862#factEXIT >#78#return; 59578#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61828#$Ultimate##0 ~n := #in~n; 61857#L25 assume ~n <= 0;#res := 1; 61856#factFINAL assume true; 61854#factEXIT >#80#return; 59588#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 59589#$Ultimate##0 ~n := #in~n; 61692#L25 assume !(~n <= 0); 61682#L26 call #t~ret0 := fact(~n - 1);< 61786#$Ultimate##0 ~n := #in~n; 61815#L25 assume ~n <= 0;#res := 1; 61811#factFINAL assume true; 61802#factEXIT >#70#return; 61804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61826#factFINAL assume true; 61607#factEXIT >#82#return; 61606#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 59534#binomialCoefficient_returnLabel#2 [2023-11-29 01:11:14,230 INFO L750 eck$LassoCheckResult]: Loop: 59534#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 59555#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 59970#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 59558#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 59559#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60745#$Ultimate##0 ~n := #in~n; 60937#L25 assume !(~n <= 0); 60773#L26 call #t~ret0 := fact(~n - 1);< 60798#$Ultimate##0 ~n := #in~n; 60794#L25 assume !(~n <= 0); 60770#L26 call #t~ret0 := fact(~n - 1);< 60922#$Ultimate##0 ~n := #in~n; 60794#L25 assume !(~n <= 0); 60770#L26 call #t~ret0 := fact(~n - 1);< 60922#$Ultimate##0 ~n := #in~n; 60794#L25 assume !(~n <= 0); 60770#L26 call #t~ret0 := fact(~n - 1);< 60922#$Ultimate##0 ~n := #in~n; 60925#L25 assume ~n <= 0;#res := 1; 60924#factFINAL assume true; 60920#factEXIT >#70#return; 60919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60915#factFINAL assume true; 60910#factEXIT >#70#return; 60909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60906#factFINAL assume true; 60896#factEXIT >#70#return; 60905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60959#factFINAL assume true; 60769#factEXIT >#70#return; 60784#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60753#factFINAL assume true; 60754#factEXIT >#78#return; 60744#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60745#$Ultimate##0 ~n := #in~n; 60937#L25 assume !(~n <= 0); 60773#L26 call #t~ret0 := fact(~n - 1);< 60798#$Ultimate##0 ~n := #in~n; 60794#L25 assume !(~n <= 0); 60770#L26 call #t~ret0 := fact(~n - 1);< 60922#$Ultimate##0 ~n := #in~n; 60794#L25 assume !(~n <= 0); 60770#L26 call #t~ret0 := fact(~n - 1);< 60922#$Ultimate##0 ~n := #in~n; 60925#L25 assume ~n <= 0;#res := 1; 60924#factFINAL assume true; 60920#factEXIT >#70#return; 60919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60915#factFINAL assume true; 60910#factEXIT >#70#return; 60909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60906#factFINAL assume true; 60896#factEXIT >#70#return; 60903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61553#factFINAL assume true; 61554#factEXIT >#80#return; 60752#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61568#$Ultimate##0 ~n := #in~n; 61565#L25 assume !(~n <= 0); 60898#L26 call #t~ret0 := fact(~n - 1);< 61562#$Ultimate##0 ~n := #in~n; 61567#L25 assume ~n <= 0;#res := 1; 61563#factFINAL assume true; 61556#factEXIT >#70#return; 61559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61570#factFINAL assume true; 61569#factEXIT >#82#return; 59533#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 59534#binomialCoefficient_returnLabel#2 [2023-11-29 01:11:14,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash -453366944, now seen corresponding path program 2 times [2023-11-29 01:11:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965178] [2023-11-29 01:11:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:14,239 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836688858] [2023-11-29 01:11:14,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:14,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:14,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:14,243 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:14,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2023-11-29 01:11:14,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:14,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:14,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:14,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:14,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1927049626, now seen corresponding path program 6 times [2023-11-29 01:11:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:14,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374847008] [2023-11-29 01:11:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:14,354 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353653047] [2023-11-29 01:11:14,355 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:11:14,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:14,359 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:14,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2023-11-29 01:11:14,439 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-11-29 01:11:14,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:14,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:14,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:14,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:14,477 INFO L85 PathProgramCache]: Analyzing trace with hash -713262523, now seen corresponding path program 1 times [2023-11-29 01:11:14,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:14,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491270220] [2023-11-29 01:11:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:14,485 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143397483] [2023-11-29 01:11:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:14,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:14,486 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:14,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2023-11-29 01:11:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:14,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:11:14,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 471 proven. 19 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2023-11-29 01:11:14,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 111 proven. 101 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2023-11-29 01:11:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491270220] [2023-11-29 01:11:14,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143397483] [2023-11-29 01:11:14,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143397483] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:14,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-11-29 01:11:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523746801] [2023-11-29 01:11:14,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:15,376 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:15,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:15,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:15,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:15,376 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:11:15,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:15,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:15,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-11-29 01:11:15,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:15,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:15,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,444 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:15,444 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:11:15,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,446 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2023-11-29 01:11:15,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,459 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2023-11-29 01:11:15,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,462 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2023-11-29 01:11:15,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,476 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,476 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2023-11-29 01:11:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,479 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2023-11-29 01:11:15,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,492 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,492 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=3} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2023-11-29 01:11:15,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,496 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-11-29 01:11:15,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,510 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,510 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=4} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2023-11-29 01:11:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,514 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-11-29 01:11:15,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,527 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,528 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=4} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2023-11-29 01:11:15,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,532 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-11-29 01:11:15,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,534 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,546 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,546 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=3} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-11-29 01:11:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,550 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-11-29 01:11:15,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,564 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,564 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=3} Honda state: {ULTIMATE.start_main_~n~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2023-11-29 01:11:15,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,567 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2023-11-29 01:11:15,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,586 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,586 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=4} Honda state: {ULTIMATE.start_main_~x~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:15,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,589 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2023-11-29 01:11:15,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,603 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2023-11-29 01:11:15,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,607 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2023-11-29 01:11:15,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,620 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,621 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2023-11-29 01:11:15,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,624 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2023-11-29 01:11:15,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:15,638 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=4} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:15,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2023-11-29 01:11:15,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,641 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2023-11-29 01:11:15,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:15,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2023-11-29 01:11:15,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,658 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2023-11-29 01:11:15,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:11:15,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:15,672 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:11:15,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2023-11-29 01:11:15,674 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:15,674 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:15,674 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:15,674 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:15,675 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:11:15,675 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:15,675 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:15,675 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-11-29 01:11:15,675 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:15,675 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:15,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:15,751 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:15,751 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:11:15,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,752 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2023-11-29 01:11:15,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:15,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,769 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2023-11-29 01:11:15,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2023-11-29 01:11:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,787 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2023-11-29 01:11:15,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2023-11-29 01:11:15,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,807 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2023-11-29 01:11:15,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2023-11-29 01:11:15,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,825 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2023-11-29 01:11:15,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2023-11-29 01:11:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,843 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2023-11-29 01:11:15,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2023-11-29 01:11:15,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,861 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2023-11-29 01:11:15,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2023-11-29 01:11:15,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,878 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2023-11-29 01:11:15,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2023-11-29 01:11:15,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,896 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2023-11-29 01:11:15,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2023-11-29 01:11:15,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,915 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2023-11-29 01:11:15,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2023-11-29 01:11:15,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,933 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2023-11-29 01:11:15,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2023-11-29 01:11:15,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,950 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2023-11-29 01:11:15,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:15,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2023-11-29 01:11:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,967 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2023-11-29 01:11:15,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:15,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:15,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:15,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:15,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:15,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:15,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:15,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:15,982 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:11:15,984 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:11:15,984 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:11:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:15,985 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:15,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2023-11-29 01:11:15,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:11:15,987 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:11:15,987 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:11:15,987 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2023-11-29 01:11:15,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2023-11-29 01:11:15,990 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:11:15,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:16,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 01:11:16,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:16,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2023-11-29 01:11:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:16,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 01:11:16,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-29 01:11:16,552 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2023-11-29 01:11:16,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4047 states and 6682 transitions. cyclomatic complexity: 2687 Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-29 01:11:16,996 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4047 states and 6682 transitions. cyclomatic complexity: 2687. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Result 7954 states and 12222 transitions. Complement of second has 67 states. [2023-11-29 01:11:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-11-29 01:11:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-29 01:11:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2023-11-29 01:11:16,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 108 transitions. Stem has 55 letters. Loop has 68 letters. [2023-11-29 01:11:16,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:16,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 108 transitions. Stem has 123 letters. Loop has 68 letters. [2023-11-29 01:11:16,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:16,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 108 transitions. Stem has 55 letters. Loop has 136 letters. [2023-11-29 01:11:17,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:17,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7954 states and 12222 transitions. [2023-11-29 01:11:17,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2023-11-29 01:11:17,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7954 states to 5620 states and 8757 transitions. [2023-11-29 01:11:17,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 728 [2023-11-29 01:11:17,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 733 [2023-11-29 01:11:17,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5620 states and 8757 transitions. [2023-11-29 01:11:17,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:17,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5620 states and 8757 transitions. [2023-11-29 01:11:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5620 states and 8757 transitions. [2023-11-29 01:11:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5620 to 4410. [2023-11-29 01:11:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4410 states, 2760 states have (on average 1.0952898550724637) internal successors, (3023), 2742 states have internal predecessors, (3023), 929 states have call successors, (996), 644 states have call predecessors, (996), 721 states have return successors, (3072), 1023 states have call predecessors, (3072), 929 states have call successors, (3072) [2023-11-29 01:11:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 7091 transitions. [2023-11-29 01:11:17,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4410 states and 7091 transitions. [2023-11-29 01:11:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:17,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:11:17,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:11:17,261 INFO L87 Difference]: Start difference. First operand 4410 states and 7091 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 9 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-29 01:11:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:17,594 INFO L93 Difference]: Finished difference Result 5379 states and 9535 transitions. [2023-11-29 01:11:17,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5379 states and 9535 transitions. [2023-11-29 01:11:17,640 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 170 [2023-11-29 01:11:17,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5379 states to 5352 states and 9497 transitions. [2023-11-29 01:11:17,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 828 [2023-11-29 01:11:17,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 828 [2023-11-29 01:11:17,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5352 states and 9497 transitions. [2023-11-29 01:11:17,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:17,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5352 states and 9497 transitions. [2023-11-29 01:11:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5352 states and 9497 transitions. [2023-11-29 01:11:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5352 to 4653. [2023-11-29 01:11:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 2884 states have (on average 1.0977808599167822) internal successors, (3166), 2867 states have internal predecessors, (3166), 1048 states have call successors, (1124), 644 states have call predecessors, (1124), 721 states have return successors, (3479), 1141 states have call predecessors, (3479), 1048 states have call successors, (3479) [2023-11-29 01:11:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 7769 transitions. [2023-11-29 01:11:17,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4653 states and 7769 transitions. [2023-11-29 01:11:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:11:17,859 INFO L428 stractBuchiCegarLoop]: Abstraction has 4653 states and 7769 transitions. [2023-11-29 01:11:17,859 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-29 01:11:17,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4653 states and 7769 transitions. [2023-11-29 01:11:17,871 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2023-11-29 01:11:17,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:17,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:17,872 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, 1] [2023-11-29 01:11:17,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:17,873 INFO L748 eck$LassoCheckResult]: Stem: 82616#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 82553#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 82554#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 82576#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 82563#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 82565#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 85753#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 85750#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 85751#$Ultimate##0 ~n := #in~n; 85754#L25 assume ~n <= 0;#res := 1; 85752#factFINAL assume true; 85749#factEXIT >#72#return; 85731#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 85748#$Ultimate##0 ~n := #in~n; 85735#L25 assume ~n <= 0;#res := 1; 85736#factFINAL assume true; 85730#factEXIT >#74#return; 85732#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85920#$Ultimate##0 ~n := #in~n; 86133#L25 assume ~n <= 0;#res := 1; 86131#factFINAL assume true; 86130#factEXIT >#76#return; 86129#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 86128#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86126#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86120#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86117#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 86111#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86114#$Ultimate##0 ~n := #in~n; 86145#L25 assume !(~n <= 0); 86122#L26 call #t~ret0 := fact(~n - 1);< 86125#$Ultimate##0 ~n := #in~n; 86136#L25 assume ~n <= 0;#res := 1; 86132#factFINAL assume true; 86121#factEXIT >#70#return; 86119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86116#factFINAL assume true; 86110#factEXIT >#78#return; 86103#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86107#$Ultimate##0 ~n := #in~n; 86115#L25 assume ~n <= 0;#res := 1; 86109#factFINAL assume true; 86102#factEXIT >#80#return; 85696#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 85697#$Ultimate##0 ~n := #in~n; 86082#L25 assume !(~n <= 0); 86064#L26 call #t~ret0 := fact(~n - 1);< 86077#$Ultimate##0 ~n := #in~n; 86070#L25 assume ~n <= 0;#res := 1; 86071#factFINAL assume true; 86085#factEXIT >#70#return; 86084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86083#factFINAL assume true; 86042#factEXIT >#82#return; 86045#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 86236#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 86235#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82669#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 82670#L42-4 havoc main_~k~0#1; 82574#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 82575#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 82732#L42-3 [2023-11-29 01:11:17,873 INFO L750 eck$LassoCheckResult]: Loop: 82732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82731#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 82723#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 82727#$Ultimate##0 ~n := #in~n; 82729#L25 assume !(~n <= 0); 82730#L26 call #t~ret0 := fact(~n - 1);< 82781#$Ultimate##0 ~n := #in~n; 83103#L25 assume ~n <= 0;#res := 1; 83160#factFINAL assume true; 82780#factEXIT >#70#return; 82740#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82738#factFINAL assume true; 82736#factEXIT >#72#return; 82721#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82727#$Ultimate##0 ~n := #in~n; 82729#L25 assume ~n <= 0;#res := 1; 82728#factFINAL assume true; 82720#factEXIT >#74#return; 82715#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 83084#$Ultimate##0 ~n := #in~n; 83156#L25 assume ~n <= 0;#res := 1; 83157#factFINAL assume true; 82714#factEXIT >#76#return; 82711#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 82709#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 82704#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82686#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 82684#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 82653#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 82673#$Ultimate##0 ~n := #in~n; 82810#L25 assume !(~n <= 0); 82691#L26 call #t~ret0 := fact(~n - 1);< 82712#$Ultimate##0 ~n := #in~n; 82710#L25 assume ~n <= 0;#res := 1; 82705#factFINAL assume true; 82687#factEXIT >#70#return; 82685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82682#factFINAL assume true; 82630#factEXIT >#78#return; 82666#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 82809#$Ultimate##0 ~n := #in~n; 82811#L25 assume ~n <= 0;#res := 1; 82808#factFINAL assume true; 82805#factEXIT >#80#return; 82652#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 82846#$Ultimate##0 ~n := #in~n; 82845#L25 assume !(~n <= 0); 82691#L26 call #t~ret0 := fact(~n - 1);< 82712#$Ultimate##0 ~n := #in~n; 82713#L25 assume !(~n <= 0); 82797#L26 call #t~ret0 := fact(~n - 1);< 82836#$Ultimate##0 ~n := #in~n; 82713#L25 assume !(~n <= 0); 82797#L26 call #t~ret0 := fact(~n - 1);< 82836#$Ultimate##0 ~n := #in~n; 82841#L25 assume ~n <= 0;#res := 1; 82837#factFINAL assume true; 82832#factEXIT >#70#return; 82831#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82827#factFINAL assume true; 82815#factEXIT >#70#return; 82825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82874#factFINAL assume true; 82869#factEXIT >#70#return; 82865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 82863#factFINAL assume true; 82864#factEXIT >#82#return; 82665#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 82852#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 82850#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 82624#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 82621#L42-4 havoc main_~k~0#1; 82572#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 82573#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 82732#L42-3 [2023-11-29 01:11:17,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 1 times [2023-11-29 01:11:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753473190] [2023-11-29 01:11:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:17,880 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980620132] [2023-11-29 01:11:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:17,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:17,882 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:17,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2023-11-29 01:11:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:17,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:17,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:17,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 215910951, now seen corresponding path program 1 times [2023-11-29 01:11:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046310186] [2023-11-29 01:11:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:18,002 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951337437] [2023-11-29 01:11:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:18,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:18,003 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:18,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2023-11-29 01:11:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:18,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:11:18,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 131 proven. 7 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-11-29 01:11:18,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 11 proven. 78 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 01:11:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046310186] [2023-11-29 01:11:18,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951337437] [2023-11-29 01:11:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951337437] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:18,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-11-29 01:11:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544204463] [2023-11-29 01:11:18,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:18,257 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:11:18,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:11:18,258 INFO L87 Difference]: Start difference. First operand 4653 states and 7769 transitions. cyclomatic complexity: 3174 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2023-11-29 01:11:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:18,419 INFO L93 Difference]: Finished difference Result 4953 states and 8361 transitions. [2023-11-29 01:11:18,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4953 states and 8361 transitions. [2023-11-29 01:11:18,446 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 164 [2023-11-29 01:11:18,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4953 states to 4947 states and 8349 transitions. [2023-11-29 01:11:18,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 778 [2023-11-29 01:11:18,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 778 [2023-11-29 01:11:18,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4947 states and 8349 transitions. [2023-11-29 01:11:18,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:18,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4947 states and 8349 transitions. [2023-11-29 01:11:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states and 8349 transitions. [2023-11-29 01:11:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4671. [2023-11-29 01:11:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 2896 states have (on average 1.0959944751381216) internal successors, (3174), 2873 states have internal predecessors, (3174), 1054 states have call successors, (1130), 650 states have call predecessors, (1130), 721 states have return successors, (3491), 1147 states have call predecessors, (3491), 1054 states have call successors, (3491) [2023-11-29 01:11:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7795 transitions. [2023-11-29 01:11:18,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4671 states and 7795 transitions. [2023-11-29 01:11:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:11:18,605 INFO L428 stractBuchiCegarLoop]: Abstraction has 4671 states and 7795 transitions. [2023-11-29 01:11:18,605 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-29 01:11:18,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4671 states and 7795 transitions. [2023-11-29 01:11:18,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 137 [2023-11-29 01:11:18,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:18,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:18,656 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, 1] [2023-11-29 01:11:18,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 8, 8, 8, 8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:18,656 INFO L748 eck$LassoCheckResult]: Stem: 92683#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 92629#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 92630#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 92653#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 92641#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95831#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 95828#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95829#$Ultimate##0 ~n := #in~n; 95832#L25 assume ~n <= 0;#res := 1; 95830#factFINAL assume true; 95827#factEXIT >#72#return; 95810#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95826#$Ultimate##0 ~n := #in~n; 95814#L25 assume ~n <= 0;#res := 1; 95815#factFINAL assume true; 95809#factEXIT >#74#return; 95811#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96009#$Ultimate##0 ~n := #in~n; 96177#L25 assume ~n <= 0;#res := 1; 96175#factFINAL assume true; 96171#factEXIT >#76#return; 96165#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 96163#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 96161#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 96160#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 96159#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 96155#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 96157#$Ultimate##0 ~n := #in~n; 96174#L25 assume !(~n <= 0); 96168#L26 call #t~ret0 := fact(~n - 1);< 96170#$Ultimate##0 ~n := #in~n; 96176#L25 assume ~n <= 0;#res := 1; 96172#factFINAL assume true; 96166#factEXIT >#70#return; 96164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96162#factFINAL assume true; 96153#factEXIT >#78#return; 96147#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 96151#$Ultimate##0 ~n := #in~n; 96158#L25 assume ~n <= 0;#res := 1; 96152#factFINAL assume true; 96146#factEXIT >#80#return; 96140#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96145#$Ultimate##0 ~n := #in~n; 96234#L25 assume !(~n <= 0); 96215#L26 call #t~ret0 := fact(~n - 1);< 96228#$Ultimate##0 ~n := #in~n; 96220#L25 assume ~n <= 0;#res := 1; 96221#factFINAL assume true; 96239#factEXIT >#70#return; 96238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96237#factFINAL assume true; 96138#factEXIT >#82#return; 96142#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 94641#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94642#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); 92696#L42-4 havoc main_~k~0#1; 92651#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 92652#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92989#L42-3 [2023-11-29 01:11:18,657 INFO L750 eck$LassoCheckResult]: Loop: 92989#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92986#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 92981#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92983#$Ultimate##0 ~n := #in~n; 92987#L25 assume !(~n <= 0); 92988#L26 call #t~ret0 := fact(~n - 1);< 93137#$Ultimate##0 ~n := #in~n; 93145#L25 assume !(~n <= 0); 93135#L26 call #t~ret0 := fact(~n - 1);< 93144#$Ultimate##0 ~n := #in~n; 93147#L25 assume ~n <= 0;#res := 1; 93156#factFINAL assume true; 93153#factEXIT >#70#return; 93151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93150#factFINAL assume true; 93148#factEXIT >#70#return; 93149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93173#factFINAL assume true; 93172#factEXIT >#72#return; 92979#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92983#$Ultimate##0 ~n := #in~n; 92987#L25 assume ~n <= 0;#res := 1; 92985#factFINAL assume true; 92977#factEXIT >#74#return; 92780#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92782#$Ultimate##0 ~n := #in~n; 93158#L25 assume !(~n <= 0); 92797#L26 call #t~ret0 := fact(~n - 1);< 92825#$Ultimate##0 ~n := #in~n; 92820#L25 assume !(~n <= 0); 92798#L26 call #t~ret0 := fact(~n - 1);< 92817#$Ultimate##0 ~n := #in~n; 92823#L25 assume ~n <= 0;#res := 1; 92819#factFINAL assume true; 92814#factEXIT >#70#return; 92813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92806#factFINAL assume true; 92787#factEXIT >#70#return; 92804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92885#factFINAL assume true; 92886#factEXIT >#76#return; 92777#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 92776#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 92775#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92774#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 92773#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 92705#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 92740#$Ultimate##0 ~n := #in~n; 92846#L25 assume !(~n <= 0); 92752#L26 call #t~ret0 := fact(~n - 1);< 92824#$Ultimate##0 ~n := #in~n; 92769#L25 assume ~n <= 0;#res := 1; 92768#factFINAL assume true; 92751#factEXIT >#70#return; 92750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92748#factFINAL assume true; 92700#factEXIT >#78#return; 92727#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 92843#$Ultimate##0 ~n := #in~n; 92845#L25 assume ~n <= 0;#res := 1; 92844#factFINAL assume true; 92838#factEXIT >#80#return; 92701#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 92749#$Ultimate##0 ~n := #in~n; 92772#L25 assume !(~n <= 0); 92752#L26 call #t~ret0 := fact(~n - 1);< 92824#$Ultimate##0 ~n := #in~n; 92820#L25 assume !(~n <= 0); 92798#L26 call #t~ret0 := fact(~n - 1);< 92817#$Ultimate##0 ~n := #in~n; 92820#L25 assume !(~n <= 0); 92798#L26 call #t~ret0 := fact(~n - 1);< 92817#$Ultimate##0 ~n := #in~n; 92823#L25 assume ~n <= 0;#res := 1; 92819#factFINAL assume true; 92814#factEXIT >#70#return; 92813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92806#factFINAL assume true; 92787#factEXIT >#70#return; 92801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92868#factFINAL assume true; 92863#factEXIT >#70#return; 92865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 92738#factFINAL assume true; 92739#factEXIT >#82#return; 92724#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 92837#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 92693#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 92694#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 92688#L42-4 havoc main_~k~0#1; 92649#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 92650#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 92989#L42-3 [2023-11-29 01:11:18,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 2 times [2023-11-29 01:11:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:18,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558611870] [2023-11-29 01:11:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:18,666 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:18,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666969734] [2023-11-29 01:11:18,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:18,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:18,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:18,673 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:18,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2023-11-29 01:11:18,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:18,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:18,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:18,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:18,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1268487385, now seen corresponding path program 2 times [2023-11-29 01:11:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791656718] [2023-11-29 01:11:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:18,816 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:18,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426509721] [2023-11-29 01:11:18,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:18,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:18,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:18,820 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:18,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2023-11-29 01:11:18,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:18,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:18,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:11:18,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 243 proven. 44 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-11-29 01:11:18,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 15 proven. 124 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2023-11-29 01:11:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791656718] [2023-11-29 01:11:19,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426509721] [2023-11-29 01:11:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426509721] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:19,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2023-11-29 01:11:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72325687] [2023-11-29 01:11:19,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:19,233 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:11:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:11:19,233 INFO L87 Difference]: Start difference. First operand 4671 states and 7795 transitions. cyclomatic complexity: 3182 Second operand has 18 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 16 states have internal predecessors, (46), 11 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2023-11-29 01:11:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:19,684 INFO L93 Difference]: Finished difference Result 5377 states and 9375 transitions. [2023-11-29 01:11:19,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5377 states and 9375 transitions. [2023-11-29 01:11:19,729 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 248 [2023-11-29 01:11:19,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5377 states to 5377 states and 9375 transitions. [2023-11-29 01:11:19,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 886 [2023-11-29 01:11:19,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 886 [2023-11-29 01:11:19,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5377 states and 9375 transitions. [2023-11-29 01:11:19,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:19,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5377 states and 9375 transitions. [2023-11-29 01:11:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states and 9375 transitions. [2023-11-29 01:11:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 4777. [2023-11-29 01:11:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4777 states, 2966 states have (on average 1.0917060013486177) internal successors, (3238), 2933 states have internal predecessors, (3238), 1090 states have call successors, (1168), 650 states have call predecessors, (1168), 721 states have return successors, (3721), 1193 states have call predecessors, (3721), 1090 states have call successors, (3721) [2023-11-29 01:11:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 8127 transitions. [2023-11-29 01:11:19,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4777 states and 8127 transitions. [2023-11-29 01:11:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 01:11:19,999 INFO L428 stractBuchiCegarLoop]: Abstraction has 4777 states and 8127 transitions. [2023-11-29 01:11:19,999 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-29 01:11:19,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4777 states and 8127 transitions. [2023-11-29 01:11:20,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2023-11-29 01:11:20,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:20,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:20,020 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, 1] [2023-11-29 01:11:20,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:20,020 INFO L748 eck$LassoCheckResult]: Stem: 103323#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 103255#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 103256#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 103276#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 103263#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 103265#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 106591#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 106588#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106589#$Ultimate##0 ~n := #in~n; 106592#L25 assume ~n <= 0;#res := 1; 106590#factFINAL assume true; 106587#factEXIT >#72#return; 106573#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106586#$Ultimate##0 ~n := #in~n; 106572#L25 assume ~n <= 0;#res := 1; 106574#factFINAL assume true; 106593#factEXIT >#74#return; 106594#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106730#$Ultimate##0 ~n := #in~n; 106778#L25 assume ~n <= 0;#res := 1; 106777#factFINAL assume true; 106776#factEXIT >#76#return; 106774#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 106770#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 106767#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 106761#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 106759#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 106753#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106756#$Ultimate##0 ~n := #in~n; 106769#L25 assume !(~n <= 0); 106763#L26 call #t~ret0 := fact(~n - 1);< 106766#$Ultimate##0 ~n := #in~n; 106771#L25 assume ~n <= 0;#res := 1; 106768#factFINAL assume true; 106762#factEXIT >#70#return; 106760#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106758#factFINAL assume true; 106752#factEXIT >#78#return; 106747#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106750#$Ultimate##0 ~n := #in~n; 106757#L25 assume ~n <= 0;#res := 1; 106751#factFINAL assume true; 106745#factEXIT >#80#return; 106326#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106327#$Ultimate##0 ~n := #in~n; 106642#L25 assume !(~n <= 0); 106616#L26 call #t~ret0 := fact(~n - 1);< 106636#$Ultimate##0 ~n := #in~n; 106628#L25 assume ~n <= 0;#res := 1; 106629#factFINAL assume true; 106613#factEXIT >#70#return; 106618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106644#factFINAL assume true; 106600#factEXIT >#82#return; 106603#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 105010#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 105011#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103335#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 103329#L42-4 havoc main_~k~0#1; 103270#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 103271#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 103589#L42-3 [2023-11-29 01:11:20,021 INFO L750 eck$LassoCheckResult]: Loop: 103589#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103587#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103577#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103582#$Ultimate##0 ~n := #in~n; 103585#L25 assume !(~n <= 0); 103586#L26 call #t~ret0 := fact(~n - 1);< 103592#$Ultimate##0 ~n := #in~n; 103594#L25 assume ~n <= 0;#res := 1; 103593#factFINAL assume true; 103591#factEXIT >#70#return; 103590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103588#factFINAL assume true; 103584#factEXIT >#72#return; 103576#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103582#$Ultimate##0 ~n := #in~n; 103585#L25 assume ~n <= 0;#res := 1; 103583#factFINAL assume true; 103574#factEXIT >#74#return; 103571#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103572#$Ultimate##0 ~n := #in~n; 103871#L25 assume !(~n <= 0); 103393#L26 call #t~ret0 := fact(~n - 1);< 103467#$Ultimate##0 ~n := #in~n; 103410#L25 assume ~n <= 0;#res := 1; 103409#factFINAL assume true; 103392#factEXIT >#70#return; 103403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 104035#factFINAL assume true; 103570#factEXIT >#76#return; 103569#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 103568#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 103567#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103566#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103565#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103359#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103378#$Ultimate##0 ~n := #in~n; 103424#L25 assume !(~n <= 0); 103399#L26 call #t~ret0 := fact(~n - 1);< 103467#$Ultimate##0 ~n := #in~n; 103464#L25 assume !(~n <= 0); 103429#L26 call #t~ret0 := fact(~n - 1);< 103458#$Ultimate##0 ~n := #in~n; 103462#L25 assume ~n <= 0;#res := 1; 103461#factFINAL assume true; 103456#factEXIT >#70#return; 103455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103448#factFINAL assume true; 103428#factEXIT >#70#return; 103427#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103425#factFINAL assume true; 103422#factEXIT >#72#return; 103362#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103378#$Ultimate##0 ~n := #in~n; 103424#L25 assume !(~n <= 0); 103399#L26 call #t~ret0 := fact(~n - 1);< 103467#$Ultimate##0 ~n := #in~n; 103410#L25 assume ~n <= 0;#res := 1; 103409#factFINAL assume true; 103392#factEXIT >#70#return; 103391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103389#factFINAL assume true; 103336#factEXIT >#74#return; 103365#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103519#$Ultimate##0 ~n := #in~n; 103512#L25 assume ~n <= 0;#res := 1; 103506#factFINAL assume true; 103500#factEXIT >#76#return; 103498#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 103485#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 103481#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103474#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 103379#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 103349#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 103378#$Ultimate##0 ~n := #in~n; 103424#L25 assume !(~n <= 0); 103399#L26 call #t~ret0 := fact(~n - 1);< 103467#$Ultimate##0 ~n := #in~n; 103410#L25 assume ~n <= 0;#res := 1; 103409#factFINAL assume true; 103392#factEXIT >#70#return; 103391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103389#factFINAL assume true; 103336#factEXIT >#78#return; 103370#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 103420#$Ultimate##0 ~n := #in~n; 103423#L25 assume ~n <= 0;#res := 1; 103421#factFINAL assume true; 103415#factEXIT >#80#return; 103352#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 103472#$Ultimate##0 ~n := #in~n; 103412#L25 assume !(~n <= 0); 103399#L26 call #t~ret0 := fact(~n - 1);< 103467#$Ultimate##0 ~n := #in~n; 103464#L25 assume !(~n <= 0); 103429#L26 call #t~ret0 := fact(~n - 1);< 103458#$Ultimate##0 ~n := #in~n; 103464#L25 assume !(~n <= 0); 103429#L26 call #t~ret0 := fact(~n - 1);< 103458#$Ultimate##0 ~n := #in~n; 103464#L25 assume !(~n <= 0); 103429#L26 call #t~ret0 := fact(~n - 1);< 103458#$Ultimate##0 ~n := #in~n; 103462#L25 assume ~n <= 0;#res := 1; 103461#factFINAL assume true; 103456#factEXIT >#70#return; 103455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103448#factFINAL assume true; 103428#factEXIT >#70#return; 103441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103497#factFINAL assume true; 103492#factEXIT >#70#return; 103490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103489#factFINAL assume true; 103486#factEXIT >#70#return; 103488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 103376#factFINAL assume true; 103377#factEXIT >#82#return; 103334#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 103333#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 103332#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 103330#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 103328#L42-4 havoc main_~k~0#1; 103268#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 103269#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 103589#L42-3 [2023-11-29 01:11:20,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 3 times [2023-11-29 01:11:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635632052] [2023-11-29 01:11:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:20,028 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837464879] [2023-11-29 01:11:20,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:11:20,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:20,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:20,030 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:20,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2023-11-29 01:11:20,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-29 01:11:20,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:20,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:20,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:20,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 165458000, now seen corresponding path program 3 times [2023-11-29 01:11:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:20,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263249599] [2023-11-29 01:11:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:20,158 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:20,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32381125] [2023-11-29 01:11:20,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:11:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:20,162 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:20,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2023-11-29 01:11:20,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-29 01:11:20,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:20,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 01:11:20,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 107 proven. 94 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-11-29 01:11:20,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 105 proven. 97 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2023-11-29 01:11:20,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:20,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263249599] [2023-11-29 01:11:20,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32381125] [2023-11-29 01:11:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32381125] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:20,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2023-11-29 01:11:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354529481] [2023-11-29 01:11:20,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:20,682 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:20,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:11:20,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-11-29 01:11:20,682 INFO L87 Difference]: Start difference. First operand 4777 states and 8127 transitions. cyclomatic complexity: 3408 Second operand has 23 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 23 states have internal predecessors, (48), 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) [2023-11-29 01:11:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:21,417 INFO L93 Difference]: Finished difference Result 6289 states and 12564 transitions. [2023-11-29 01:11:21,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6289 states and 12564 transitions. [2023-11-29 01:11:21,459 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 376 [2023-11-29 01:11:21,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6289 states to 6280 states and 12554 transitions. [2023-11-29 01:11:21,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1121 [2023-11-29 01:11:21,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1121 [2023-11-29 01:11:21,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6280 states and 12554 transitions. [2023-11-29 01:11:21,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:21,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6280 states and 12554 transitions. [2023-11-29 01:11:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states and 12554 transitions. [2023-11-29 01:11:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 4912. [2023-11-29 01:11:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4912 states, 3043 states have (on average 1.0933289516924087) internal successors, (3327), 3003 states have internal predecessors, (3327), 1148 states have call successors, (1230), 650 states have call predecessors, (1230), 721 states have return successors, (3921), 1258 states have call predecessors, (3921), 1148 states have call successors, (3921) [2023-11-29 01:11:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 8478 transitions. [2023-11-29 01:11:21,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4912 states and 8478 transitions. [2023-11-29 01:11:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:11:21,728 INFO L428 stractBuchiCegarLoop]: Abstraction has 4912 states and 8478 transitions. [2023-11-29 01:11:21,728 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-11-29 01:11:21,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4912 states and 8478 transitions. [2023-11-29 01:11:21,742 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 168 [2023-11-29 01:11:21,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:21,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:21,743 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, 1] [2023-11-29 01:11:21,743 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, 1] [2023-11-29 01:11:21,744 INFO L748 eck$LassoCheckResult]: Stem: 115192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 115119#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 115120#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 115142#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 115129#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 115130#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 118587#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 118584#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 118585#$Ultimate##0 ~n := #in~n; 118588#L25 assume ~n <= 0;#res := 1; 118586#factFINAL assume true; 118583#factEXIT >#72#return; 118571#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 118582#$Ultimate##0 ~n := #in~n; 118570#L25 assume ~n <= 0;#res := 1; 118572#factFINAL assume true; 118589#factEXIT >#74#return; 118561#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 118639#$Ultimate##0 ~n := #in~n; 118643#L25 assume ~n <= 0;#res := 1; 118642#factFINAL assume true; 118638#factEXIT >#76#return; 118635#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 118632#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 118628#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 118625#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 118619#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 118613#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 118615#$Ultimate##0 ~n := #in~n; 118627#L25 assume !(~n <= 0); 118621#L26 call #t~ret0 := fact(~n - 1);< 118624#$Ultimate##0 ~n := #in~n; 118629#L25 assume ~n <= 0;#res := 1; 118626#factFINAL assume true; 118620#factEXIT >#70#return; 118618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 118617#factFINAL assume true; 118611#factEXIT >#78#return; 118606#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 118609#$Ultimate##0 ~n := #in~n; 118616#L25 assume ~n <= 0;#res := 1; 118610#factFINAL assume true; 118604#factEXIT >#80#return; 118597#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 118603#$Ultimate##0 ~n := #in~n; 118726#L25 assume !(~n <= 0); 118702#L26 call #t~ret0 := fact(~n - 1);< 118717#$Ultimate##0 ~n := #in~n; 118712#L25 assume ~n <= 0;#res := 1; 118713#factFINAL assume true; 118731#factEXIT >#70#return; 118730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 118729#factFINAL assume true; 118596#factEXIT >#82#return; 118600#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 119161#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 115671#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115203#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 115204#L42-4 havoc main_~k~0#1; 115140#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115141#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 115436#L42-3 [2023-11-29 01:11:21,744 INFO L750 eck$LassoCheckResult]: Loop: 115436#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115435#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 115419#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115423#$Ultimate##0 ~n := #in~n; 115425#L25 assume !(~n <= 0); 115426#L26 call #t~ret0 := fact(~n - 1);< 115431#$Ultimate##0 ~n := #in~n; 115433#L25 assume ~n <= 0;#res := 1; 115432#factFINAL assume true; 115430#factEXIT >#70#return; 115429#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115428#factFINAL assume true; 115427#factEXIT >#72#return; 115417#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115423#$Ultimate##0 ~n := #in~n; 115425#L25 assume ~n <= 0;#res := 1; 115424#factFINAL assume true; 115415#factEXIT >#74#return; 115412#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115414#$Ultimate##0 ~n := #in~n; 115524#L25 assume !(~n <= 0); 115276#L26 call #t~ret0 := fact(~n - 1);< 115339#$Ultimate##0 ~n := #in~n; 115290#L25 assume ~n <= 0;#res := 1; 115285#factFINAL assume true; 115268#factEXIT >#70#return; 115283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115607#factFINAL assume true; 115411#factEXIT >#76#return; 115410#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 115409#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 115408#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115407#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115406#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 115224#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115251#$Ultimate##0 ~n := #in~n; 115292#L25 assume !(~n <= 0); 115272#L26 call #t~ret0 := fact(~n - 1);< 115339#$Ultimate##0 ~n := #in~n; 115290#L25 assume ~n <= 0;#res := 1; 115285#factFINAL assume true; 115268#factEXIT >#70#return; 115267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115266#factFINAL assume true; 115261#factEXIT >#72#return; 115233#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115251#$Ultimate##0 ~n := #in~n; 115292#L25 assume !(~n <= 0); 115272#L26 call #t~ret0 := fact(~n - 1);< 115339#$Ultimate##0 ~n := #in~n; 115290#L25 assume ~n <= 0;#res := 1; 115285#factFINAL assume true; 115268#factEXIT >#70#return; 115267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115266#factFINAL assume true; 115261#factEXIT >#74#return; 115236#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115402#$Ultimate##0 ~n := #in~n; 115401#L25 assume ~n <= 0;#res := 1; 115393#factFINAL assume true; 115388#factEXIT >#76#return; 115387#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 115383#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 115382#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115381#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115380#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 115209#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115251#$Ultimate##0 ~n := #in~n; 115292#L25 assume !(~n <= 0); 115272#L26 call #t~ret0 := fact(~n - 1);< 115339#$Ultimate##0 ~n := #in~n; 115336#L25 assume !(~n <= 0); 115306#L26 call #t~ret0 := fact(~n - 1);< 115332#$Ultimate##0 ~n := #in~n; 115338#L25 assume ~n <= 0;#res := 1; 115335#factFINAL assume true; 115330#factEXIT >#70#return; 115329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115320#factFINAL assume true; 115300#factEXIT >#70#return; 115299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115297#factFINAL assume true; 115296#factEXIT >#78#return; 115220#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115251#$Ultimate##0 ~n := #in~n; 115292#L25 assume ~n <= 0;#res := 1; 115260#factFINAL assume true; 115253#factEXIT >#80#return; 115208#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115298#$Ultimate##0 ~n := #in~n; 115351#L25 assume !(~n <= 0); 115309#L26 call #t~ret0 := fact(~n - 1);< 115319#$Ultimate##0 ~n := #in~n; 115336#L25 assume !(~n <= 0); 115306#L26 call #t~ret0 := fact(~n - 1);< 115332#$Ultimate##0 ~n := #in~n; 115338#L25 assume ~n <= 0;#res := 1; 115335#factFINAL assume true; 115330#factEXIT >#70#return; 115329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115320#factFINAL assume true; 115300#factEXIT >#70#return; 115299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115297#factFINAL assume true; 115296#factEXIT >#82#return; 115205#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 115202#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 115201#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115199#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 115196#L42-4 havoc main_~k~0#1; 115138#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115139#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 115436#L42-3 [2023-11-29 01:11:21,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1588829542, now seen corresponding path program 4 times [2023-11-29 01:11:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209009745] [2023-11-29 01:11:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:21,750 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206678228] [2023-11-29 01:11:21,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:11:21,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:21,751 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:21,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2023-11-29 01:11:21,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:11:21,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:21,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:21,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:21,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1307946416, now seen corresponding path program 4 times [2023-11-29 01:11:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266035814] [2023-11-29 01:11:21,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:21,876 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:21,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532211904] [2023-11-29 01:11:21,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:11:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:21,877 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:21,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2023-11-29 01:11:21,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:11:21,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:21,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 01:11:21,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 239 proven. 48 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2023-11-29 01:11:22,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 48 proven. 69 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-11-29 01:11:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266035814] [2023-11-29 01:11:22,224 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532211904] [2023-11-29 01:11:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532211904] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:22,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-11-29 01:11:22,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062819496] [2023-11-29 01:11:22,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:22,225 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:11:22,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:11:22,226 INFO L87 Difference]: Start difference. First operand 4912 states and 8478 transitions. cyclomatic complexity: 3625 Second operand has 12 states, 9 states have (on average 4.111111111111111) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-29 01:11:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:22,459 INFO L93 Difference]: Finished difference Result 5406 states and 9447 transitions. [2023-11-29 01:11:22,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5406 states and 9447 transitions. [2023-11-29 01:11:22,535 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 186 [2023-11-29 01:11:22,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5406 states to 5374 states and 9393 transitions. [2023-11-29 01:11:22,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 840 [2023-11-29 01:11:22,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 840 [2023-11-29 01:11:22,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5374 states and 9393 transitions. [2023-11-29 01:11:22,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:22,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5374 states and 9393 transitions. [2023-11-29 01:11:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states and 9393 transitions. [2023-11-29 01:11:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 4950. [2023-11-29 01:11:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4950 states, 3055 states have (on average 1.0936170212765957) internal successors, (3341), 3020 states have internal predecessors, (3341), 1174 states have call successors, (1260), 646 states have call predecessors, (1260), 721 states have return successors, (4003), 1283 states have call predecessors, (4003), 1174 states have call successors, (4003) [2023-11-29 01:11:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 8604 transitions. [2023-11-29 01:11:22,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4950 states and 8604 transitions. [2023-11-29 01:11:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:11:22,738 INFO L428 stractBuchiCegarLoop]: Abstraction has 4950 states and 8604 transitions. [2023-11-29 01:11:22,738 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-11-29 01:11:22,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4950 states and 8604 transitions. [2023-11-29 01:11:22,756 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 176 [2023-11-29 01:11:22,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:22,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:22,758 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, 1] [2023-11-29 01:11:22,758 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, 1] [2023-11-29 01:11:22,758 INFO L748 eck$LassoCheckResult]: Stem: 126189#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 126127#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 126128#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 126150#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 126137#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 126139#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129630#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 129627#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129628#$Ultimate##0 ~n := #in~n; 129631#L25 assume ~n <= 0;#res := 1; 129629#factFINAL assume true; 129626#factEXIT >#72#return; 129610#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129625#$Ultimate##0 ~n := #in~n; 129615#L25 assume ~n <= 0;#res := 1; 129616#factFINAL assume true; 129609#factEXIT >#74#return; 129611#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129791#$Ultimate##0 ~n := #in~n; 130065#L25 assume ~n <= 0;#res := 1; 130063#factFINAL assume true; 130062#factEXIT >#76#return; 130061#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 130053#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 130041#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130039#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130038#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 129988#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129989#$Ultimate##0 ~n := #in~n; 130006#L25 assume !(~n <= 0); 130001#L26 call #t~ret0 := fact(~n - 1);< 130004#$Ultimate##0 ~n := #in~n; 130008#L25 assume ~n <= 0;#res := 1; 130007#factFINAL assume true; 130000#factEXIT >#70#return; 129997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129995#factFINAL assume true; 129985#factEXIT >#78#return; 129978#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129982#$Ultimate##0 ~n := #in~n; 129990#L25 assume ~n <= 0;#res := 1; 129984#factFINAL assume true; 129977#factEXIT >#80#return; 129581#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129582#$Ultimate##0 ~n := #in~n; 129956#L25 assume !(~n <= 0); 129933#L26 call #t~ret0 := fact(~n - 1);< 129946#$Ultimate##0 ~n := #in~n; 129944#L25 assume ~n <= 0;#res := 1; 129941#factFINAL assume true; 129942#factEXIT >#70#return; 129961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129960#factFINAL assume true; 129917#factEXIT >#82#return; 129920#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 128427#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 128428#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126650#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 126648#L42-4 havoc main_~k~0#1; 126647#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 126429#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 126431#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126419#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 126399#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126406#$Ultimate##0 ~n := #in~n; 126409#L25 assume !(~n <= 0); 126410#L26 call #t~ret0 := fact(~n - 1);< 126414#$Ultimate##0 ~n := #in~n; 126416#L25 assume ~n <= 0;#res := 1; 126415#factFINAL assume true; 126413#factEXIT >#70#return; 126412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126411#factFINAL assume true; 126408#factEXIT >#72#return; 126397#L30-1 [2023-11-29 01:11:22,759 INFO L750 eck$LassoCheckResult]: Loop: 126397#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126406#$Ultimate##0 ~n := #in~n; 126409#L25 assume ~n <= 0;#res := 1; 126407#factFINAL assume true; 126396#factEXIT >#74#return; 126393#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126395#$Ultimate##0 ~n := #in~n; 126512#L25 assume !(~n <= 0); 126262#L26 call #t~ret0 := fact(~n - 1);< 126271#$Ultimate##0 ~n := #in~n; 126323#L25 assume !(~n <= 0); 126293#L26 call #t~ret0 := fact(~n - 1);< 126317#$Ultimate##0 ~n := #in~n; 126321#L25 assume ~n <= 0;#res := 1; 126320#factFINAL assume true; 126315#factEXIT >#70#return; 126314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126305#factFINAL assume true; 126284#factEXIT >#70#return; 126302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126516#factFINAL assume true; 126503#factEXIT >#76#return; 126391#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 126390#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 126389#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126388#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126387#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 126224#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126247#$Ultimate##0 ~n := #in~n; 126566#L25 assume !(~n <= 0); 126265#L26 call #t~ret0 := fact(~n - 1);< 126271#$Ultimate##0 ~n := #in~n; 126323#L25 assume !(~n <= 0); 126293#L26 call #t~ret0 := fact(~n - 1);< 126317#$Ultimate##0 ~n := #in~n; 126323#L25 assume !(~n <= 0); 126293#L26 call #t~ret0 := fact(~n - 1);< 126317#$Ultimate##0 ~n := #in~n; 126321#L25 assume ~n <= 0;#res := 1; 126320#factFINAL assume true; 126315#factEXIT >#70#return; 126314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126305#factFINAL assume true; 126284#factEXIT >#70#return; 126301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126359#factFINAL assume true; 126353#factEXIT >#70#return; 126346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126344#factFINAL assume true; 126340#factEXIT >#72#return; 126209#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126247#$Ultimate##0 ~n := #in~n; 126566#L25 assume !(~n <= 0); 126265#L26 call #t~ret0 := fact(~n - 1);< 126271#$Ultimate##0 ~n := #in~n; 126323#L25 assume !(~n <= 0); 126293#L26 call #t~ret0 := fact(~n - 1);< 126317#$Ultimate##0 ~n := #in~n; 126323#L25 assume !(~n <= 0); 126293#L26 call #t~ret0 := fact(~n - 1);< 126317#$Ultimate##0 ~n := #in~n; 126321#L25 assume ~n <= 0;#res := 1; 126320#factFINAL assume true; 126315#factEXIT >#70#return; 126314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126305#factFINAL assume true; 126284#factEXIT >#70#return; 126301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126359#factFINAL assume true; 126353#factEXIT >#70#return; 126346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126344#factFINAL assume true; 126340#factEXIT >#74#return; 126228#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126495#$Ultimate##0 ~n := #in~n; 126494#L25 assume ~n <= 0;#res := 1; 126370#factFINAL assume true; 126365#factEXIT >#76#return; 126364#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 126362#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 126361#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126360#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126358#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 126219#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126247#$Ultimate##0 ~n := #in~n; 126566#L25 assume !(~n <= 0); 126265#L26 call #t~ret0 := fact(~n - 1);< 126271#$Ultimate##0 ~n := #in~n; 126323#L25 assume !(~n <= 0); 126293#L26 call #t~ret0 := fact(~n - 1);< 126317#$Ultimate##0 ~n := #in~n; 126321#L25 assume ~n <= 0;#res := 1; 126320#factFINAL assume true; 126315#factEXIT >#70#return; 126314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126305#factFINAL assume true; 126284#factEXIT >#70#return; 126272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126254#factFINAL assume true; 126252#factEXIT >#78#return; 126207#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126237#$Ultimate##0 ~n := #in~n; 126379#L25 assume !(~n <= 0); 126265#L26 call #t~ret0 := fact(~n - 1);< 126271#$Ultimate##0 ~n := #in~n; 126304#L25 assume ~n <= 0;#res := 1; 126273#factFINAL assume true; 126255#factEXIT >#70#return; 126253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126250#factFINAL assume true; 126201#factEXIT >#80#return; 126226#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126336#$Ultimate##0 ~n := #in~n; 126334#L25 assume !(~n <= 0); 126261#L26 call #t~ret0 := fact(~n - 1);< 126312#$Ultimate##0 ~n := #in~n; 126313#L25 assume !(~n <= 0); 126290#L26 call #t~ret0 := fact(~n - 1);< 126318#$Ultimate##0 ~n := #in~n; 126324#L25 assume !(~n <= 0); 126316#L26 call #t~ret0 := fact(~n - 1);< 126319#$Ultimate##0 ~n := #in~n; 126321#L25 assume ~n <= 0;#res := 1; 126320#factFINAL assume true; 126315#factEXIT >#70#return; 126314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126305#factFINAL assume true; 126284#factEXIT >#70#return; 126301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126359#factFINAL assume true; 126353#factEXIT >#70#return; 126346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126344#factFINAL assume true; 126340#factEXIT >#82#return; 126200#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 126199#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 126198#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126196#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 126194#L42-4 havoc main_~k~0#1; 126146#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 126147#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 126423#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126424#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 126401#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126406#$Ultimate##0 ~n := #in~n; 126409#L25 assume !(~n <= 0); 126410#L26 call #t~ret0 := fact(~n - 1);< 126414#$Ultimate##0 ~n := #in~n; 126416#L25 assume ~n <= 0;#res := 1; 126415#factFINAL assume true; 126413#factEXIT >#70#return; 126412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126411#factFINAL assume true; 126408#factEXIT >#72#return; 126397#L30-1 [2023-11-29 01:11:22,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -115555602, now seen corresponding path program 5 times [2023-11-29 01:11:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:22,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649118651] [2023-11-29 01:11:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:22,767 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:22,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139794177] [2023-11-29 01:11:22,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:11:22,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:22,769 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:22,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2023-11-29 01:11:22,863 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-11-29 01:11:22,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:22,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:22,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:22,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1218714862, now seen corresponding path program 5 times [2023-11-29 01:11:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:22,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539151936] [2023-11-29 01:11:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:22,916 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604298224] [2023-11-29 01:11:22,917 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:11:22,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:22,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:22,921 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:22,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2023-11-29 01:11:23,010 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-11-29 01:11:23,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:23,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:11:23,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 551 proven. 94 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2023-11-29 01:11:23,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 347 proven. 146 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-11-29 01:11:23,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539151936] [2023-11-29 01:11:23,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:23,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604298224] [2023-11-29 01:11:23,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604298224] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:23,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:23,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2023-11-29 01:11:23,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665030620] [2023-11-29 01:11:23,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:23,600 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:23,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:23,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:11:23,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:11:23,601 INFO L87 Difference]: Start difference. First operand 4950 states and 8604 transitions. cyclomatic complexity: 3716 Second operand has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 11 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (19), 9 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-29 01:11:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:23,955 INFO L93 Difference]: Finished difference Result 5955 states and 9888 transitions. [2023-11-29 01:11:23,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5955 states and 9888 transitions. [2023-11-29 01:11:23,984 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 242 [2023-11-29 01:11:24,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5955 states to 5929 states and 9862 transitions. [2023-11-29 01:11:24,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 949 [2023-11-29 01:11:24,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 949 [2023-11-29 01:11:24,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5929 states and 9862 transitions. [2023-11-29 01:11:24,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:24,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5929 states and 9862 transitions. [2023-11-29 01:11:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5929 states and 9862 transitions. [2023-11-29 01:11:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5929 to 5036. [2023-11-29 01:11:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5036 states, 3093 states have (on average 1.094406724862593) internal successors, (3385), 3032 states have internal predecessors, (3385), 1236 states have call successors, (1322), 692 states have call predecessors, (1322), 707 states have return successors, (3998), 1311 states have call predecessors, (3998), 1236 states have call successors, (3998) [2023-11-29 01:11:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 8705 transitions. [2023-11-29 01:11:24,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5036 states and 8705 transitions. [2023-11-29 01:11:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:11:24,158 INFO L428 stractBuchiCegarLoop]: Abstraction has 5036 states and 8705 transitions. [2023-11-29 01:11:24,158 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-11-29 01:11:24,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5036 states and 8705 transitions. [2023-11-29 01:11:24,178 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 186 [2023-11-29 01:11:24,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:24,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:24,179 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, 1] [2023-11-29 01:11:24,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:24,179 INFO L748 eck$LassoCheckResult]: Stem: 138051#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 137989#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 137990#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 138012#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 138000#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 138001#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 141567#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141563#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141564#$Ultimate##0 ~n := #in~n; 141566#L25 assume ~n <= 0;#res := 1; 141565#factFINAL assume true; 141562#factEXIT >#72#return; 141544#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141561#$Ultimate##0 ~n := #in~n; 141548#L25 assume ~n <= 0;#res := 1; 141549#factFINAL assume true; 141543#factEXIT >#74#return; 141545#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141740#$Ultimate##0 ~n := #in~n; 141899#L25 assume ~n <= 0;#res := 1; 141898#factFINAL assume true; 141897#factEXIT >#76#return; 141895#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 141893#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 141888#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 141887#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 141881#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 141874#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 141877#$Ultimate##0 ~n := #in~n; 141892#L25 assume !(~n <= 0); 141883#L26 call #t~ret0 := fact(~n - 1);< 141886#$Ultimate##0 ~n := #in~n; 141894#L25 assume ~n <= 0;#res := 1; 141889#factFINAL assume true; 141882#factEXIT >#70#return; 141880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 141879#factFINAL assume true; 141873#factEXIT >#78#return; 141867#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 141870#$Ultimate##0 ~n := #in~n; 141878#L25 assume ~n <= 0;#res := 1; 141872#factFINAL assume true; 141866#factEXIT >#80#return; 141854#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 141865#$Ultimate##0 ~n := #in~n; 141956#L25 assume !(~n <= 0); 141909#L26 call #t~ret0 := fact(~n - 1);< 141933#$Ultimate##0 ~n := #in~n; 141935#L25 assume ~n <= 0;#res := 1; 141936#factFINAL assume true; 141907#factEXIT >#70#return; 141913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142052#factFINAL assume true; 141853#factEXIT >#82#return; 141858#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 138953#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 138954#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 138405#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 138403#L42-4 havoc main_~k~0#1; 138402#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138397#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 138395#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138393#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138385#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138390#$Ultimate##0 ~n := #in~n; 138399#L25 assume !(~n <= 0); 138400#L26 call #t~ret0 := fact(~n - 1);< 138459#$Ultimate##0 ~n := #in~n; 138461#L25 assume ~n <= 0;#res := 1; 138460#factFINAL assume true; 138458#factEXIT >#70#return; 138457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138456#factFINAL assume true; 138455#factEXIT >#72#return; 138383#L30-1 [2023-11-29 01:11:24,180 INFO L750 eck$LassoCheckResult]: Loop: 138383#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138390#$Ultimate##0 ~n := #in~n; 138399#L25 assume ~n <= 0;#res := 1; 138392#factFINAL assume true; 138381#factEXIT >#74#return; 138387#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 138454#$Ultimate##0 ~n := #in~n; 138680#L25 assume !(~n <= 0); 138129#L26 call #t~ret0 := fact(~n - 1);< 138200#$Ultimate##0 ~n := #in~n; 138195#L25 assume !(~n <= 0); 138162#L26 call #t~ret0 := fact(~n - 1);< 138190#$Ultimate##0 ~n := #in~n; 138197#L25 assume ~n <= 0;#res := 1; 138193#factFINAL assume true; 138188#factEXIT >#70#return; 138187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138175#factFINAL assume true; 138154#factEXIT >#70#return; 138171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138672#factFINAL assume true; 138673#factEXIT >#76#return; 138441#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 138350#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 138346#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 138343#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138328#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138066#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138102#$Ultimate##0 ~n := #in~n; 138257#L25 assume !(~n <= 0); 138123#L26 call #t~ret0 := fact(~n - 1);< 138200#$Ultimate##0 ~n := #in~n; 138149#L25 assume ~n <= 0;#res := 1; 138141#factFINAL assume true; 138120#factEXIT >#70#return; 138119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138117#factFINAL assume true; 138062#factEXIT >#72#return; 138065#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138102#$Ultimate##0 ~n := #in~n; 138257#L25 assume !(~n <= 0); 138123#L26 call #t~ret0 := fact(~n - 1);< 138200#$Ultimate##0 ~n := #in~n; 138195#L25 assume !(~n <= 0); 138162#L26 call #t~ret0 := fact(~n - 1);< 138190#$Ultimate##0 ~n := #in~n; 138197#L25 assume ~n <= 0;#res := 1; 138193#factFINAL assume true; 138188#factEXIT >#70#return; 138187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138175#factFINAL assume true; 138154#factEXIT >#70#return; 138153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138152#factFINAL assume true; 138151#factEXIT >#74#return; 138107#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 138805#$Ultimate##0 ~n := #in~n; 138256#L25 assume ~n <= 0;#res := 1; 138253#factFINAL assume true; 138239#factEXIT >#76#return; 138237#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 138232#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 138231#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 138224#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138222#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138085#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138102#$Ultimate##0 ~n := #in~n; 138257#L25 assume !(~n <= 0); 138123#L26 call #t~ret0 := fact(~n - 1);< 138200#$Ultimate##0 ~n := #in~n; 138195#L25 assume !(~n <= 0); 138162#L26 call #t~ret0 := fact(~n - 1);< 138190#$Ultimate##0 ~n := #in~n; 138197#L25 assume ~n <= 0;#res := 1; 138193#factFINAL assume true; 138188#factEXIT >#70#return; 138187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138175#factFINAL assume true; 138154#factEXIT >#70#return; 138153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138152#factFINAL assume true; 138151#factEXIT >#78#return; 138084#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138101#$Ultimate##0 ~n := #in~n; 138150#L25 assume !(~n <= 0); 138123#L26 call #t~ret0 := fact(~n - 1);< 138200#$Ultimate##0 ~n := #in~n; 138149#L25 assume ~n <= 0;#res := 1; 138141#factFINAL assume true; 138120#factEXIT >#70#return; 138119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138117#factFINAL assume true; 138062#factEXIT >#80#return; 138064#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 138118#$Ultimate##0 ~n := #in~n; 138186#L25 assume !(~n <= 0); 138124#L26 call #t~ret0 := fact(~n - 1);< 138140#$Ultimate##0 ~n := #in~n; 138149#L25 assume ~n <= 0;#res := 1; 138141#factFINAL assume true; 138120#factEXIT >#70#return; 138119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138117#factFINAL assume true; 138062#factEXIT >#82#return; 138059#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 138058#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 138057#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 138055#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 138052#L42-4 havoc main_~k~0#1; 138009#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138010#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 138396#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138394#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138384#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138390#$Ultimate##0 ~n := #in~n; 138399#L25 assume !(~n <= 0); 138400#L26 call #t~ret0 := fact(~n - 1);< 138459#$Ultimate##0 ~n := #in~n; 138461#L25 assume ~n <= 0;#res := 1; 138460#factFINAL assume true; 138458#factEXIT >#70#return; 138457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138456#factFINAL assume true; 138455#factEXIT >#72#return; 138383#L30-1 [2023-11-29 01:11:24,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -115555602, now seen corresponding path program 6 times [2023-11-29 01:11:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442906974] [2023-11-29 01:11:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:24,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:24,187 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916746294] [2023-11-29 01:11:24,188 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:11:24,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:24,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:24,190 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:24,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2023-11-29 01:11:24,286 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-11-29 01:11:24,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:24,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:24,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:24,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1030687726, now seen corresponding path program 6 times [2023-11-29 01:11:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256485242] [2023-11-29 01:11:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:24,335 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939645946] [2023-11-29 01:11:24,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:11:24,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:24,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:24,340 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:24,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2023-11-29 01:11:24,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-11-29 01:11:24,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:24,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:11:24,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 155 proven. 46 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-11-29 01:11:24,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 155 proven. 47 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2023-11-29 01:11:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256485242] [2023-11-29 01:11:24,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939645946] [2023-11-29 01:11:24,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939645946] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:24,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:24,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2023-11-29 01:11:24,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531408380] [2023-11-29 01:11:24,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:24,758 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:24,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:24,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:11:24,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:11:24,759 INFO L87 Difference]: Start difference. First operand 5036 states and 8705 transitions. cyclomatic complexity: 3731 Second operand has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 14 states have internal predecessors, (40), 8 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2023-11-29 01:11:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:25,334 INFO L93 Difference]: Finished difference Result 6356 states and 12459 transitions. [2023-11-29 01:11:25,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6356 states and 12459 transitions. [2023-11-29 01:11:25,379 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 287 [2023-11-29 01:11:25,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6356 states to 5619 states and 10619 transitions. [2023-11-29 01:11:25,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1051 [2023-11-29 01:11:25,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1057 [2023-11-29 01:11:25,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5619 states and 10619 transitions. [2023-11-29 01:11:25,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:25,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5619 states and 10619 transitions. [2023-11-29 01:11:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5619 states and 10619 transitions. [2023-11-29 01:11:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5619 to 5174. [2023-11-29 01:11:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5174 states, 3142 states have (on average 1.0942075111394016) internal successors, (3438), 3090 states have internal predecessors, (3438), 1357 states have call successors, (1477), 630 states have call predecessors, (1477), 675 states have return successors, (4385), 1453 states have call predecessors, (4385), 1357 states have call successors, (4385) [2023-11-29 01:11:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5174 states to 5174 states and 9300 transitions. [2023-11-29 01:11:25,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5174 states and 9300 transitions. [2023-11-29 01:11:25,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:11:25,537 INFO L428 stractBuchiCegarLoop]: Abstraction has 5174 states and 9300 transitions. [2023-11-29 01:11:25,537 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-11-29 01:11:25,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5174 states and 9300 transitions. [2023-11-29 01:11:25,553 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 245 [2023-11-29 01:11:25,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:25,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:25,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:25,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:25,555 INFO L748 eck$LassoCheckResult]: Stem: 150232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 150180#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 150181#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 150202#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 150189#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 150190#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 150825#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 150176#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 150177#$Ultimate##0 ~n := #in~n; 150900#L25 assume ~n <= 0;#res := 1; 150897#factFINAL assume true; 150891#factEXIT >#72#return; 150222#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 150223#$Ultimate##0 ~n := #in~n; 151289#L25 assume ~n <= 0;#res := 1; 151287#factFINAL assume true; 151285#factEXIT >#74#return; 150155#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 150156#$Ultimate##0 ~n := #in~n; 151682#L25 assume ~n <= 0;#res := 1; 151681#factFINAL assume true; 151679#factEXIT >#76#return; 151675#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 151672#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 151670#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 151662#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 151660#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 151654#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 151657#$Ultimate##0 ~n := #in~n; 151671#L25 assume !(~n <= 0); 151667#L26 call #t~ret0 := fact(~n - 1);< 151669#$Ultimate##0 ~n := #in~n; 151676#L25 assume ~n <= 0;#res := 1; 151674#factFINAL assume true; 151665#factEXIT >#70#return; 151661#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151659#factFINAL assume true; 151652#factEXIT >#78#return; 151646#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 151648#$Ultimate##0 ~n := #in~n; 151694#L25 assume ~n <= 0;#res := 1; 151691#factFINAL assume true; 151645#factEXIT >#80#return; 151639#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 151644#$Ultimate##0 ~n := #in~n; 153056#L25 assume !(~n <= 0); 153009#L26 call #t~ret0 := fact(~n - 1);< 153026#$Ultimate##0 ~n := #in~n; 153029#L25 assume ~n <= 0;#res := 1; 153030#factFINAL assume true; 153007#factEXIT >#70#return; 153011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 153065#factFINAL assume true; 151638#factEXIT >#82#return; 151637#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 151532#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 151533#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 151529#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 151397#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 151293#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 151393#$Ultimate##0 ~n := #in~n; 151298#L25 assume ~n <= 0;#res := 1; 151292#factFINAL assume true; 151295#factEXIT >#72#return; 151306#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 151275#$Ultimate##0 ~n := #in~n; 151305#L25 assume ~n <= 0;#res := 1; 151307#factFINAL assume true; 151431#factEXIT >#74#return; 151266#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 151296#$Ultimate##0 ~n := #in~n; 151297#L25 assume ~n <= 0;#res := 1; 151265#factFINAL assume true; 151268#factEXIT >#76#return; 151429#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 151424#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 151406#L42-2 [2023-11-29 01:11:25,555 INFO L750 eck$LassoCheckResult]: Loop: 151406#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 151407#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 151400#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 151326#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 151333#$Ultimate##0 ~n := #in~n; 151422#L25 assume !(~n <= 0); 151338#L26 call #t~ret0 := fact(~n - 1);< 151358#$Ultimate##0 ~n := #in~n; 151389#L25 assume !(~n <= 0); 151342#L26 call #t~ret0 := fact(~n - 1);< 151386#$Ultimate##0 ~n := #in~n; 151389#L25 assume !(~n <= 0); 151342#L26 call #t~ret0 := fact(~n - 1);< 151386#$Ultimate##0 ~n := #in~n; 151389#L25 assume !(~n <= 0); 151342#L26 call #t~ret0 := fact(~n - 1);< 151386#$Ultimate##0 ~n := #in~n; 151389#L25 assume !(~n <= 0); 151342#L26 call #t~ret0 := fact(~n - 1);< 151386#$Ultimate##0 ~n := #in~n; 151391#L25 assume ~n <= 0;#res := 1; 151388#factFINAL assume true; 151384#factEXIT >#70#return; 151383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151378#factFINAL assume true; 151373#factEXIT >#70#return; 151372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151369#factFINAL assume true; 151365#factEXIT >#70#return; 151364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151362#factFINAL assume true; 151360#factEXIT >#70#return; 151348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151354#factFINAL assume true; 151335#factEXIT >#70#return; 151334#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151332#factFINAL assume true; 151322#factEXIT >#78#return; 151328#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 151333#$Ultimate##0 ~n := #in~n; 151422#L25 assume ~n <= 0;#res := 1; 151421#factFINAL assume true; 151420#factEXIT >#80#return; 151325#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 151412#$Ultimate##0 ~n := #in~n; 151394#L25 assume !(~n <= 0); 151340#L26 call #t~ret0 := fact(~n - 1);< 151353#$Ultimate##0 ~n := #in~n; 151401#L25 assume !(~n <= 0); 151337#L26 call #t~ret0 := fact(~n - 1);< 151357#$Ultimate##0 ~n := #in~n; 151389#L25 assume !(~n <= 0); 151342#L26 call #t~ret0 := fact(~n - 1);< 151386#$Ultimate##0 ~n := #in~n; 151389#L25 assume !(~n <= 0); 151342#L26 call #t~ret0 := fact(~n - 1);< 151386#$Ultimate##0 ~n := #in~n; 151389#L25 assume !(~n <= 0); 151342#L26 call #t~ret0 := fact(~n - 1);< 151386#$Ultimate##0 ~n := #in~n; 151391#L25 assume ~n <= 0;#res := 1; 151388#factFINAL assume true; 151384#factEXIT >#70#return; 151383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151378#factFINAL assume true; 151373#factEXIT >#70#return; 151372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151369#factFINAL assume true; 151365#factEXIT >#70#return; 151364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151362#factFINAL assume true; 151360#factEXIT >#70#return; 151348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151354#factFINAL assume true; 151335#factEXIT >#70#return; 151334#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 151332#factFINAL assume true; 151322#factEXIT >#82#return; 151330#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 151423#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 151406#L42-2 [2023-11-29 01:11:25,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:25,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1394171404, now seen corresponding path program 2 times [2023-11-29 01:11:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392996680] [2023-11-29 01:11:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:25,561 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49516034] [2023-11-29 01:11:25,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:25,563 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:25,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2023-11-29 01:11:25,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:25,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:25,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:11:25,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-29 01:11:25,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:11:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392996680] [2023-11-29 01:11:25,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49516034] [2023-11-29 01:11:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49516034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:11:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:11:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:11:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529477179] [2023-11-29 01:11:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:11:25,718 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:25,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash -215673796, now seen corresponding path program 7 times [2023-11-29 01:11:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:25,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581756856] [2023-11-29 01:11:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:25,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:25,725 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517074313] [2023-11-29 01:11:25,725 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:11:25,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:25,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:25,727 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:25,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2023-11-29 01:11:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:25,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:25,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:26,419 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:26,419 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:26,419 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:26,419 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:26,419 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:11:26,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:26,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:26,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2023-11-29 01:11:26,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:26,420 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:26,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,490 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:26,491 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:11:26,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,494 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2023-11-29 01:11:26,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:26,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:26,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:26,515 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:26,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2023-11-29 01:11:26,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,518 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2023-11-29 01:11:26,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:26,521 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:26,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:26,532 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:26,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2023-11-29 01:11:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,536 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2023-11-29 01:11:26,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:26,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:26,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2023-11-29 01:11:26,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,553 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2023-11-29 01:11:26,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:11:26,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:26,568 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:11:26,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2023-11-29 01:11:26,571 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:26,571 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:26,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:26,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:26,571 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:11:26,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:26,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:26,571 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2023-11-29 01:11:26,571 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:26,571 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:26,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:26,632 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:26,632 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:11:26,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,633 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2023-11-29 01:11:26,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:26,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:26,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:26,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:26,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:26,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:26,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:26,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:26,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:26,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2023-11-29 01:11:26,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,651 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2023-11-29 01:11:26,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 [2023-11-29 01:11:26,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:26,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:26,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:26,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:26,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:26,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:26,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:26,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:26,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2023-11-29 01:11:26,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,667 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2023-11-29 01:11:26,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:26,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:26,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:26,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:26,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:26,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:26,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:26,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:26,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:26,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2023-11-29 01:11:26,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,684 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2023-11-29 01:11:26,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:26,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:26,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:26,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:26,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:26,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:26,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:26,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:26,699 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:11:26,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:11:26,701 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:11:26,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:26,703 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:26,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2023-11-29 01:11:26,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:11:26,705 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:11:26,705 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:11:26,705 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 9 Supporting invariants [] [2023-11-29 01:11:26,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2023-11-29 01:11:26,708 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:11:26,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:26,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 01:11:26,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:26,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2023-11-29 01:11:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:11:27,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 01:11:27,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-29 01:11:27,394 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2023-11-29 01:11:27,394 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5174 states and 9300 transitions. cyclomatic complexity: 4215 Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-29 01:11:27,803 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5174 states and 9300 transitions. cyclomatic complexity: 4215. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 13365 states and 23149 transitions. Complement of second has 74 states. [2023-11-29 01:11:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2023-11-29 01:11:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-29 01:11:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 104 transitions. [2023-11-29 01:11:27,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 104 transitions. Stem has 76 letters. Loop has 80 letters. [2023-11-29 01:11:27,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:27,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 104 transitions. Stem has 156 letters. Loop has 80 letters. [2023-11-29 01:11:27,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:27,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 104 transitions. Stem has 76 letters. Loop has 160 letters. [2023-11-29 01:11:27,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:11:27,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13365 states and 23149 transitions. [2023-11-29 01:11:27,884 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 245 [2023-11-29 01:11:27,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13365 states to 8654 states and 15440 transitions. [2023-11-29 01:11:27,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1148 [2023-11-29 01:11:27,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1155 [2023-11-29 01:11:27,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8654 states and 15440 transitions. [2023-11-29 01:11:27,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:27,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8654 states and 15440 transitions. [2023-11-29 01:11:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states and 15440 transitions. [2023-11-29 01:11:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 6723. [2023-11-29 01:11:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6723 states, 4062 states have (on average 1.086656819300837) internal successors, (4414), 4036 states have internal predecessors, (4414), 1699 states have call successors, (1868), 810 states have call predecessors, (1868), 962 states have return successors, (5799), 1876 states have call predecessors, (5799), 1699 states have call successors, (5799) [2023-11-29 01:11:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6723 states to 6723 states and 12081 transitions. [2023-11-29 01:11:28,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6723 states and 12081 transitions. [2023-11-29 01:11:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:28,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:11:28,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:11:28,188 INFO L87 Difference]: Start difference. First operand 6723 states and 12081 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 01:11:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:28,262 INFO L93 Difference]: Finished difference Result 4913 states and 9020 transitions. [2023-11-29 01:11:28,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4913 states and 9020 transitions. [2023-11-29 01:11:28,307 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 245 [2023-11-29 01:11:28,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4913 states to 4273 states and 8092 transitions. [2023-11-29 01:11:28,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 794 [2023-11-29 01:11:28,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 794 [2023-11-29 01:11:28,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4273 states and 8092 transitions. [2023-11-29 01:11:28,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:28,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4273 states and 8092 transitions. [2023-11-29 01:11:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states and 8092 transitions. [2023-11-29 01:11:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4206. [2023-11-29 01:11:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 2512 states have (on average 1.0895700636942676) internal successors, (2737), 2492 states have internal predecessors, (2737), 1139 states have call successors, (1225), 484 states have call predecessors, (1225), 555 states have return successors, (4055), 1229 states have call predecessors, (4055), 1139 states have call successors, (4055) [2023-11-29 01:11:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 8017 transitions. [2023-11-29 01:11:28,479 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4206 states and 8017 transitions. [2023-11-29 01:11:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:11:28,480 INFO L428 stractBuchiCegarLoop]: Abstraction has 4206 states and 8017 transitions. [2023-11-29 01:11:28,480 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-11-29 01:11:28,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4206 states and 8017 transitions. [2023-11-29 01:11:28,497 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 245 [2023-11-29 01:11:28,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:28,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:28,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 9, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:28,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:28,499 INFO L748 eck$LassoCheckResult]: Stem: 181195#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 181145#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 181146#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 181167#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 181196#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 181403#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 183431#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 181141#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 181142#$Ultimate##0 ~n := #in~n; 183626#L25 assume ~n <= 0;#res := 1; 183619#factFINAL assume true; 183599#factEXIT >#72#return; 181185#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 181186#$Ultimate##0 ~n := #in~n; 184413#L25 assume ~n <= 0;#res := 1; 184411#factFINAL assume true; 184410#factEXIT >#74#return; 184408#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 184409#$Ultimate##0 ~n := #in~n; 184414#L25 assume ~n <= 0;#res := 1; 184412#factFINAL assume true; 184407#factEXIT >#76#return; 184406#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 184405#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 184402#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 184400#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 184399#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 184396#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 184397#$Ultimate##0 ~n := #in~n; 184422#L25 assume !(~n <= 0); 184419#L26 call #t~ret0 := fact(~n - 1);< 184420#$Ultimate##0 ~n := #in~n; 184424#L25 assume ~n <= 0;#res := 1; 184423#factFINAL assume true; 184418#factEXIT >#70#return; 184416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184415#factFINAL assume true; 184395#factEXIT >#78#return; 184392#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 184393#$Ultimate##0 ~n := #in~n; 184421#L25 assume ~n <= 0;#res := 1; 184417#factFINAL assume true; 184391#factEXIT >#80#return; 184388#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 184389#$Ultimate##0 ~n := #in~n; 185308#L25 assume !(~n <= 0); 185306#L26 call #t~ret0 := fact(~n - 1);< 185307#$Ultimate##0 ~n := #in~n; 185315#L25 assume ~n <= 0;#res := 1; 185316#factFINAL assume true; 185305#factEXIT >#70#return; 185304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 185303#factFINAL assume true; 184387#factEXIT >#82#return; 184385#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 184380#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 184379#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 184378#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 184350#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 184221#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 184224#$Ultimate##0 ~n := #in~n; 184241#L25 assume !(~n <= 0); 184236#L26 call #t~ret0 := fact(~n - 1);< 184239#$Ultimate##0 ~n := #in~n; 184249#L25 assume ~n <= 0;#res := 1; 184246#factFINAL assume true; 184235#factEXIT >#70#return; 184233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184232#factFINAL assume true; 184220#factEXIT >#78#return; 184212#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 184213#$Ultimate##0 ~n := #in~n; 184240#L25 assume ~n <= 0;#res := 1; 184234#factFINAL assume true; 184211#factEXIT >#80#return; 183748#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 183749#$Ultimate##0 ~n := #in~n; 184085#L25 assume !(~n <= 0); 183653#L26 call #t~ret0 := fact(~n - 1);< 183718#$Ultimate##0 ~n := #in~n; 184145#L25 assume ~n <= 0;#res := 1; 184126#factFINAL assume true; 184071#factEXIT >#70#return; 184070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 184067#factFINAL assume true; 183911#factEXIT >#82#return; 183637#L30-8 [2023-11-29 01:11:28,499 INFO L750 eck$LassoCheckResult]: Loop: 183637#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 183743#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 183742#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 183741#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 183740#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 183631#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 181191#$Ultimate##0 ~n := #in~n; 183739#L25 assume !(~n <= 0); 183651#L26 call #t~ret0 := fact(~n - 1);< 183718#$Ultimate##0 ~n := #in~n; 183713#L25 assume !(~n <= 0); 183645#L26 call #t~ret0 := fact(~n - 1);< 183708#$Ultimate##0 ~n := #in~n; 183713#L25 assume !(~n <= 0); 183645#L26 call #t~ret0 := fact(~n - 1);< 183708#$Ultimate##0 ~n := #in~n; 183713#L25 assume !(~n <= 0); 183645#L26 call #t~ret0 := fact(~n - 1);< 183708#$Ultimate##0 ~n := #in~n; 183713#L25 assume !(~n <= 0); 183645#L26 call #t~ret0 := fact(~n - 1);< 183708#$Ultimate##0 ~n := #in~n; 183713#L25 assume !(~n <= 0); 183645#L26 call #t~ret0 := fact(~n - 1);< 183708#$Ultimate##0 ~n := #in~n; 183712#L25 assume ~n <= 0;#res := 1; 183710#factFINAL assume true; 183706#factEXIT >#70#return; 183705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183701#factFINAL assume true; 183695#factEXIT >#70#return; 183694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183691#factFINAL assume true; 183687#factEXIT >#70#return; 183685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183684#factFINAL assume true; 183683#factEXIT >#70#return; 183682#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183681#factFINAL assume true; 183678#factEXIT >#70#return; 183660#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183670#factFINAL assume true; 183644#factEXIT >#70#return; 183643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183638#factFINAL assume true; 183630#factEXIT >#78#return; 183632#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 181191#$Ultimate##0 ~n := #in~n; 183739#L25 assume ~n <= 0;#res := 1; 183738#factFINAL assume true; 183737#factEXIT >#80#return; 183634#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 183730#$Ultimate##0 ~n := #in~n; 183729#L25 assume !(~n <= 0); 183659#L26 call #t~ret0 := fact(~n - 1);< 183667#$Ultimate##0 ~n := #in~n; 183734#L25 assume !(~n <= 0); 183649#L26 call #t~ret0 := fact(~n - 1);< 183671#$Ultimate##0 ~n := #in~n; 183713#L25 assume !(~n <= 0); 183645#L26 call #t~ret0 := fact(~n - 1);< 183708#$Ultimate##0 ~n := #in~n; 183712#L25 assume ~n <= 0;#res := 1; 183710#factFINAL assume true; 183706#factEXIT >#70#return; 183705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183701#factFINAL assume true; 183695#factEXIT >#70#return; 183694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183691#factFINAL assume true; 183687#factEXIT >#70#return; 183679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 183750#factFINAL assume true; 183744#factEXIT >#82#return; 183637#L30-8 [2023-11-29 01:11:28,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1958623442, now seen corresponding path program 3 times [2023-11-29 01:11:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:28,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482714355] [2023-11-29 01:11:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:28,507 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719592084] [2023-11-29 01:11:28,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:11:28,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:28,508 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:28,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2023-11-29 01:11:28,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 01:11:28,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:28,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:11:28,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 77 proven. 5 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-11-29 01:11:28,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-11-29 01:11:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482714355] [2023-11-29 01:11:28,787 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719592084] [2023-11-29 01:11:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719592084] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:28,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:28,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2023-11-29 01:11:28,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221381501] [2023-11-29 01:11:28,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:28,788 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:28,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 813508028, now seen corresponding path program 8 times [2023-11-29 01:11:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:28,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937844837] [2023-11-29 01:11:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:28,793 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:28,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677979696] [2023-11-29 01:11:28,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:11:28,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:28,795 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:28,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2023-11-29 01:11:28,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:11:28,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:28,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:11:28,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 72 proven. 158 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-11-29 01:11:28,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 70 proven. 194 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 01:11:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937844837] [2023-11-29 01:11:30,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677979696] [2023-11-29 01:11:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677979696] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:30,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 27 [2023-11-29 01:11:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347345808] [2023-11-29 01:11:30,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:30,250 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:11:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:11:30,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 01:11:30,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2023-11-29 01:11:30,251 INFO L87 Difference]: Start difference. First operand 4206 states and 8017 transitions. cyclomatic complexity: 3882 Second operand has 28 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (23), 14 states have call predecessors, (23), 16 states have call successors, (23) [2023-11-29 01:11:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:11:31,339 INFO L93 Difference]: Finished difference Result 6783 states and 13498 transitions. [2023-11-29 01:11:31,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6783 states and 13498 transitions. [2023-11-29 01:11:31,386 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 455 [2023-11-29 01:11:31,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6783 states to 6711 states and 13420 transitions. [2023-11-29 01:11:31,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1250 [2023-11-29 01:11:31,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1250 [2023-11-29 01:11:31,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6711 states and 13420 transitions. [2023-11-29 01:11:31,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:11:31,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6711 states and 13420 transitions. [2023-11-29 01:11:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6711 states and 13420 transitions. [2023-11-29 01:11:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6711 to 4722. [2023-11-29 01:11:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 2760 states have (on average 1.0815217391304348) internal successors, (2985), 2736 states have internal predecessors, (2985), 1374 states have call successors, (1462), 577 states have call predecessors, (1462), 588 states have return successors, (5088), 1408 states have call predecessors, (5088), 1374 states have call successors, (5088) [2023-11-29 01:11:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 9535 transitions. [2023-11-29 01:11:31,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4722 states and 9535 transitions. [2023-11-29 01:11:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:11:31,635 INFO L428 stractBuchiCegarLoop]: Abstraction has 4722 states and 9535 transitions. [2023-11-29 01:11:31,635 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-11-29 01:11:31,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4722 states and 9535 transitions. [2023-11-29 01:11:31,650 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 287 [2023-11-29 01:11:31,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:11:31,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:11:31,652 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 9, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:31,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:11:31,652 INFO L748 eck$LassoCheckResult]: Stem: 193212#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 193158#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 193159#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 193181#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 193168#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 193170#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 193390#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 193147#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 193148#$Ultimate##0 ~n := #in~n; 194129#L25 assume ~n <= 0;#res := 1; 194128#factFINAL assume true; 194118#factEXIT >#72#return; 193199#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 193200#$Ultimate##0 ~n := #in~n; 194033#L25 assume ~n <= 0;#res := 1; 194032#factFINAL assume true; 194030#factEXIT >#74#return; 194026#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 194028#$Ultimate##0 ~n := #in~n; 194031#L25 assume ~n <= 0;#res := 1; 194029#factFINAL assume true; 194025#factEXIT >#76#return; 194027#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 194193#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 193210#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 193211#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 194637#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 194633#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 194634#$Ultimate##0 ~n := #in~n; 194643#L25 assume !(~n <= 0); 194640#L26 call #t~ret0 := fact(~n - 1);< 194641#$Ultimate##0 ~n := #in~n; 194644#L25 assume ~n <= 0;#res := 1; 194642#factFINAL assume true; 194639#factEXIT >#70#return; 194638#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194636#factFINAL assume true; 194632#factEXIT >#78#return; 194628#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 194630#$Ultimate##0 ~n := #in~n; 194635#L25 assume ~n <= 0;#res := 1; 194631#factFINAL assume true; 194627#factEXIT >#80#return; 194625#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 194626#$Ultimate##0 ~n := #in~n; 195710#L25 assume !(~n <= 0); 195708#L26 call #t~ret0 := fact(~n - 1);< 195709#$Ultimate##0 ~n := #in~n; 195752#L25 assume ~n <= 0;#res := 1; 195753#factFINAL assume true; 195707#factEXIT >#70#return; 195702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195700#factFINAL assume true; 194624#factEXIT >#82#return; 194623#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 194616#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 194600#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 194596#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 194593#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 194567#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 194570#$Ultimate##0 ~n := #in~n; 194581#L25 assume !(~n <= 0); 194575#L26 call #t~ret0 := fact(~n - 1);< 194578#$Ultimate##0 ~n := #in~n; 194583#L25 assume ~n <= 0;#res := 1; 194579#factFINAL assume true; 194574#factEXIT >#70#return; 194573#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194572#factFINAL assume true; 194566#factEXIT >#78#return; 194557#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 194563#$Ultimate##0 ~n := #in~n; 195037#L25 assume ~n <= 0;#res := 1; 195036#factFINAL assume true; 195034#factEXIT >#80#return; 195029#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 195635#$Ultimate##0 ~n := #in~n; 195028#L25 assume !(~n <= 0); 194167#L26 call #t~ret0 := fact(~n - 1);< 194306#$Ultimate##0 ~n := #in~n; 194713#L25 assume ~n <= 0;#res := 1; 194711#factFINAL assume true; 194703#factEXIT >#70#return; 194704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 195637#factFINAL assume true; 195632#factEXIT >#82#return; 194140#L30-8 [2023-11-29 01:11:31,652 INFO L750 eck$LassoCheckResult]: Loop: 194140#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 193401#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 193399#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 193400#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 194537#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 194138#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 193207#$Ultimate##0 ~n := #in~n; 194536#L25 assume !(~n <= 0); 194176#L26 call #t~ret0 := fact(~n - 1);< 194306#$Ultimate##0 ~n := #in~n; 194327#L25 assume !(~n <= 0); 194169#L26 call #t~ret0 := fact(~n - 1);< 194324#$Ultimate##0 ~n := #in~n; 194327#L25 assume !(~n <= 0); 194169#L26 call #t~ret0 := fact(~n - 1);< 194324#$Ultimate##0 ~n := #in~n; 194327#L25 assume !(~n <= 0); 194169#L26 call #t~ret0 := fact(~n - 1);< 194324#$Ultimate##0 ~n := #in~n; 194327#L25 assume !(~n <= 0); 194169#L26 call #t~ret0 := fact(~n - 1);< 194324#$Ultimate##0 ~n := #in~n; 194327#L25 assume !(~n <= 0); 194169#L26 call #t~ret0 := fact(~n - 1);< 194324#$Ultimate##0 ~n := #in~n; 194328#L25 assume ~n <= 0;#res := 1; 194325#factFINAL assume true; 194321#factEXIT >#70#return; 194320#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194315#factFINAL assume true; 194309#factEXIT >#70#return; 194307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194300#factFINAL assume true; 194294#factEXIT >#70#return; 194293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194291#factFINAL assume true; 194285#factEXIT >#70#return; 194283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194281#factFINAL assume true; 194255#factEXIT >#70#return; 194188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194223#factFINAL assume true; 194165#factEXIT >#70#return; 194164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194141#factFINAL assume true; 194133#factEXIT >#78#return; 193206#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 193207#$Ultimate##0 ~n := #in~n; 194536#L25 assume ~n <= 0;#res := 1; 194535#factFINAL assume true; 194533#factEXIT >#80#return; 194137#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 194292#$Ultimate##0 ~n := #in~n; 194289#L25 assume !(~n <= 0); 194174#L26 call #t~ret0 := fact(~n - 1);< 194192#$Ultimate##0 ~n := #in~n; 194925#L25 assume !(~n <= 0); 194178#L26 call #t~ret0 := fact(~n - 1);< 194227#$Ultimate##0 ~n := #in~n; 194522#L25 assume !(~n <= 0); 194179#L26 call #t~ret0 := fact(~n - 1);< 194286#$Ultimate##0 ~n := #in~n; 194534#L25 assume !(~n <= 0); 194181#L26 call #t~ret0 := fact(~n - 1);< 194299#$Ultimate##0 ~n := #in~n; 194331#L25 assume !(~n <= 0); 194184#L26 call #t~ret0 := fact(~n - 1);< 194314#$Ultimate##0 ~n := #in~n; 194327#L25 assume !(~n <= 0); 194169#L26 call #t~ret0 := fact(~n - 1);< 194324#$Ultimate##0 ~n := #in~n; 194328#L25 assume ~n <= 0;#res := 1; 194325#factFINAL assume true; 194321#factEXIT >#70#return; 194320#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194315#factFINAL assume true; 194309#factEXIT >#70#return; 194307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194300#factFINAL assume true; 194294#factEXIT >#70#return; 194293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194291#factFINAL assume true; 194285#factEXIT >#70#return; 194283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194281#factFINAL assume true; 194255#factEXIT >#70#return; 194188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194223#factFINAL assume true; 194165#factEXIT >#70#return; 194164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 194141#factFINAL assume true; 194133#factEXIT >#82#return; 194140#L30-8 [2023-11-29 01:11:31,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1958623442, now seen corresponding path program 4 times [2023-11-29 01:11:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189013870] [2023-11-29 01:11:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:31,660 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:31,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058776624] [2023-11-29 01:11:31,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:11:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:31,661 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:31,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2023-11-29 01:11:31,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:11:31,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:11:31,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 01:11:31,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:11:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 187 proven. 3 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 01:11:31,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:11:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 61 proven. 24 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-11-29 01:11:31,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:11:31,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189013870] [2023-11-29 01:11:31,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:11:31,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058776624] [2023-11-29 01:11:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058776624] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:11:31,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:11:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2023-11-29 01:11:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399798465] [2023-11-29 01:11:31,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:11:31,956 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:11:31,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:11:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash -490713092, now seen corresponding path program 9 times [2023-11-29 01:11:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:11:31,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926722697] [2023-11-29 01:11:31,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:11:31,960 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:11:31,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126793869] [2023-11-29 01:11:31,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:11:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:11:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:31,962 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:11:31,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2023-11-29 01:11:32,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2023-11-29 01:11:32,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:11:32,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:11:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:11:32,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:11:32,707 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:32,707 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:32,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:32,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:32,707 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:11:32,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:32,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:32,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2023-11-29 01:11:32,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:32,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:32,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,782 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:32,783 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:11:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,784 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2023-11-29 01:11:32,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,797 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,798 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=6} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2023-11-29 01:11:32,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,801 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2023-11-29 01:11:32,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,814 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,814 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: [] [2023-11-29 01:11:32,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2023-11-29 01:11:32,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,818 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2023-11-29 01:11:32,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2023-11-29 01:11:32,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,836 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2023-11-29 01:11:32,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,849 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,849 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2023-11-29 01:11:32,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,853 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2023-11-29 01:11:32,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,866 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,866 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2023-11-29 01:11:32,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,870 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2023-11-29 01:11:32,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,883 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2023-11-29 01:11:32,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,887 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2023-11-29 01:11:32,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,900 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,900 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=720} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=720} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2023-11-29 01:11:32,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,903 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2023-11-29 01:11:32,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,917 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,917 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=720} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=720} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2023-11-29 01:11:32,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,920 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2023-11-29 01:11:32,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,933 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2023-11-29 01:11:32,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,937 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2023-11-29 01:11:32,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,951 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:11:32,951 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:11:32,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2023-11-29 01:11:32,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,954 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2023-11-29 01:11:32,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:11:32,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2023-11-29 01:11:32,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:32,972 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:32,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2023-11-29 01:11:32,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:11:32,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:11:32,987 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:11:32,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2023-11-29 01:11:32,989 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:11:32,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:11:32,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:11:32,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:11:32,990 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:11:32,990 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:32,990 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:11:32,990 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:11:32,990 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2023-11-29 01:11:32,990 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:11:32,990 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:11:32,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:32,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:33,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:33,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:33,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:33,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:33,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:33,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:11:33,068 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:11:33,068 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:11:33,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:33,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:33,069 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:33,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2023-11-29 01:11:33,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:33,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:33,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:33,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:33,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:33,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:33,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:33,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:33,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:33,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2023-11-29 01:11:33,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:33,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:11:33,087 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:11:33,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2023-11-29 01:11:33,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:11:33,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:11:33,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:11:33,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:11:33,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:11:33,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:11:33,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:11:33,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:11:33,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:11:33,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2023-11-29 01:11:33,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:11:33,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2023-11-29 01:19:50,238 INFO L750 eck$LassoCheckResult]: Loop: 1460663#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1460813#$Ultimate##0 ~n := #in~n; 1462254#L25 assume !(~n <= 0); 1462006#L26 call #t~ret0 := fact(~n - 1);< 1462027#$Ultimate##0 ~n := #in~n; 1462024#L25 assume !(~n <= 0); 1462013#L26 call #t~ret0 := fact(~n - 1);< 1462021#$Ultimate##0 ~n := #in~n; 1462025#L25 assume ~n <= 0;#res := 1; 1462023#factFINAL assume true; 1462011#factEXIT >#70#return; 1462014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462029#factFINAL assume true; 1462015#factEXIT >#70#return; 1462018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1464885#factFINAL assume true; 1464884#factEXIT >#74#return; 1464852#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1464876#$Ultimate##0 ~n := #in~n; 1464883#L25 assume ~n <= 0;#res := 1; 1464881#factFINAL assume true; 1464851#factEXIT >#76#return; 1464848#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1464827#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1464824#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1464817#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1464424#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1461725#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1461947#$Ultimate##0 ~n := #in~n; 1463775#L25 assume !(~n <= 0); 1461968#L26 call #t~ret0 := fact(~n - 1);< 1462251#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1462025#L25 assume ~n <= 0;#res := 1; 1462023#factFINAL assume true; 1462011#factEXIT >#70#return; 1462014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462029#factFINAL assume true; 1462015#factEXIT >#70#return; 1462010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461981#factFINAL assume true; 1461951#factEXIT >#70#return; 1461974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462875#factFINAL assume true; 1462863#factEXIT >#78#return; 1461740#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1462281#$Ultimate##0 ~n := #in~n; 1462255#L25 assume !(~n <= 0); 1462007#L26 call #t~ret0 := fact(~n - 1);< 1462027#$Ultimate##0 ~n := #in~n; 1462024#L25 assume !(~n <= 0); 1462013#L26 call #t~ret0 := fact(~n - 1);< 1462021#$Ultimate##0 ~n := #in~n; 1462025#L25 assume ~n <= 0;#res := 1; 1462023#factFINAL assume true; 1462011#factEXIT >#70#return; 1462014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462029#factFINAL assume true; 1462015#factEXIT >#70#return; 1462016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462876#factFINAL assume true; 1462873#factEXIT >#80#return; 1461719#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1462391#$Ultimate##0 ~n := #in~n; 1462386#L25 assume !(~n <= 0); 1461969#L26 call #t~ret0 := fact(~n - 1);< 1462259#$Ultimate##0 ~n := #in~n; 1462253#L25 assume !(~n <= 0); 1462012#L26 call #t~ret0 := fact(~n - 1);< 1462026#$Ultimate##0 ~n := #in~n; 1462024#L25 assume !(~n <= 0); 1462013#L26 call #t~ret0 := fact(~n - 1);< 1462021#$Ultimate##0 ~n := #in~n; 1462025#L25 assume ~n <= 0;#res := 1; 1462023#factFINAL assume true; 1462011#factEXIT >#70#return; 1462014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462029#factFINAL assume true; 1462015#factEXIT >#70#return; 1462010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461981#factFINAL assume true; 1461951#factEXIT >#70#return; 1461974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462875#factFINAL assume true; 1462863#factEXIT >#82#return; 1462869#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1467548#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1467547#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1467546#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1467545#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1461803#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1461947#$Ultimate##0 ~n := #in~n; 1463775#L25 assume !(~n <= 0); 1461968#L26 call #t~ret0 := fact(~n - 1);< 1462251#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1462025#L25 assume ~n <= 0;#res := 1; 1462023#factFINAL assume true; 1462011#factEXIT >#70#return; 1462014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462029#factFINAL assume true; 1462015#factEXIT >#70#return; 1462010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461981#factFINAL assume true; 1461951#factEXIT >#70#return; 1461975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462905#factFINAL assume true; 1462897#factEXIT >#70#return; 1462892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462887#factFINAL assume true; 1462775#factEXIT >#78#return; 1461691#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1461947#$Ultimate##0 ~n := #in~n; 1463775#L25 assume !(~n <= 0); 1461968#L26 call #t~ret0 := fact(~n - 1);< 1462251#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1464005#L25 assume !(~n <= 0); 1461954#L26 call #t~ret0 := fact(~n - 1);< 1463818#$Ultimate##0 ~n := #in~n; 1462025#L25 assume ~n <= 0;#res := 1; 1462023#factFINAL assume true; 1462011#factEXIT >#70#return; 1462014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462029#factFINAL assume true; 1462015#factEXIT >#70#return; 1462010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461981#factFINAL assume true; 1461951#factEXIT >#70#return; 1461975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462905#factFINAL assume true; 1462897#factEXIT >#70#return; 1462899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1463674#factFINAL assume true; 1463664#factEXIT >#70#return; 1463663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1463660#factFINAL assume true; 1463638#factEXIT >#80#return; 1461666#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1462391#$Ultimate##0 ~n := #in~n; 1462386#L25 assume !(~n <= 0); 1461969#L26 call #t~ret0 := fact(~n - 1);< 1462259#$Ultimate##0 ~n := #in~n; 1462253#L25 assume !(~n <= 0); 1462012#L26 call #t~ret0 := fact(~n - 1);< 1462026#$Ultimate##0 ~n := #in~n; 1462024#L25 assume !(~n <= 0); 1462013#L26 call #t~ret0 := fact(~n - 1);< 1462021#$Ultimate##0 ~n := #in~n; 1462025#L25 assume ~n <= 0;#res := 1; 1462023#factFINAL assume true; 1462011#factEXIT >#70#return; 1462014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462029#factFINAL assume true; 1462015#factEXIT >#70#return; 1462010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461981#factFINAL assume true; 1461951#factEXIT >#70#return; 1461974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462875#factFINAL assume true; 1462863#factEXIT >#82#return; 1462868#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1468844#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1468843#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1468821#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1466913#L42-4 havoc main_~k~0#1; 1468813#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1468812#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1468811#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1468810#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1460501#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1460517#$Ultimate##0 ~n := #in~n; 1460513#L25 assume !(~n <= 0); 1460509#L26 call #t~ret0 := fact(~n - 1);< 1460510#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460518#L25 assume !(~n <= 0); 1460542#L26 call #t~ret0 := fact(~n - 1);< 1460545#$Ultimate##0 ~n := #in~n; 1460548#L25 assume ~n <= 0;#res := 1; 1460549#factFINAL assume true; 1460547#factEXIT >#70#return; 1460546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460544#factFINAL assume true; 1460541#factEXIT >#70#return; 1460543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469035#factFINAL assume true; 1469034#factEXIT >#70#return; 1469032#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469030#factFINAL assume true; 1469026#factEXIT >#70#return; 1469024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469022#factFINAL assume true; 1469020#factEXIT >#70#return; 1469017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469015#factFINAL assume true; 1469005#factEXIT >#70#return; 1469006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469072#factFINAL assume true; 1469001#factEXIT >#70#return; 1468999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1468996#factFINAL assume true; 1468991#factEXIT >#70#return; 1468988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1468986#factFINAL assume true; 1468982#factEXIT >#70#return; 1468983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469049#factFINAL assume true; 1469047#factEXIT >#70#return; 1469045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469042#factFINAL assume true; 1469038#factEXIT >#70#return; 1469037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469036#factFINAL assume true; 1469033#factEXIT >#70#return; 1469031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469029#factFINAL assume true; 1469027#factEXIT >#70#return; 1469025#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469023#factFINAL assume true; 1469018#factEXIT >#70#return; 1469016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469014#factFINAL assume true; 1469012#factEXIT >#70#return; 1469011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469010#factFINAL assume true; 1469009#factEXIT >#72#return; 1460423#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1460496#$Ultimate##0 ~n := #in~n; 1460514#L25 assume ~n <= 0;#res := 1; 1460495#factFINAL assume true; 1460418#factEXIT >#74#return; 1460463#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1469008#$Ultimate##0 ~n := #in~n; 1469007#L25 assume !(~n <= 0); 1468997#L26 call #t~ret0 := fact(~n - 1);< 1469003#$Ultimate##0 ~n := #in~n; 1469000#L25 assume !(~n <= 0); 1468989#L26 call #t~ret0 := fact(~n - 1);< 1468995#$Ultimate##0 ~n := #in~n; 1468993#L25 assume !(~n <= 0); 1468984#L26 call #t~ret0 := fact(~n - 1);< 1468987#$Ultimate##0 ~n := #in~n; 1468985#L25 assume !(~n <= 0); 1468977#L26 call #t~ret0 := fact(~n - 1);< 1468981#$Ultimate##0 ~n := #in~n; 1468979#L25 assume !(~n <= 0); 1455616#L26 call #t~ret0 := fact(~n - 1);< 1468976#$Ultimate##0 ~n := #in~n; 1468974#L25 assume !(~n <= 0); 1455615#L26 call #t~ret0 := fact(~n - 1);< 1468973#$Ultimate##0 ~n := #in~n; 1468971#L25 assume !(~n <= 0); 1455601#L26 call #t~ret0 := fact(~n - 1);< 1468962#$Ultimate##0 ~n := #in~n; 1468961#L25 assume !(~n <= 0); 1455604#L26 call #t~ret0 := fact(~n - 1);< 1468959#$Ultimate##0 ~n := #in~n; 1468958#L25 assume !(~n <= 0); 1455590#L26 call #t~ret0 := fact(~n - 1);< 1468955#$Ultimate##0 ~n := #in~n; 1468952#L25 assume !(~n <= 0); 1455602#L26 call #t~ret0 := fact(~n - 1);< 1468950#$Ultimate##0 ~n := #in~n; 1468948#L25 assume !(~n <= 0); 1455594#L26 call #t~ret0 := fact(~n - 1);< 1468945#$Ultimate##0 ~n := #in~n; 1468943#L25 assume !(~n <= 0); 1455589#L26 call #t~ret0 := fact(~n - 1);< 1468940#$Ultimate##0 ~n := #in~n; 1468938#L25 assume !(~n <= 0); 1455599#L26 call #t~ret0 := fact(~n - 1);< 1468927#$Ultimate##0 ~n := #in~n; 1468924#L25 assume !(~n <= 0); 1455592#L26 call #t~ret0 := fact(~n - 1);< 1468922#$Ultimate##0 ~n := #in~n; 1460609#L25 assume !(~n <= 0); 1455591#L26 call #t~ret0 := fact(~n - 1);< 1468921#$Ultimate##0 ~n := #in~n; 1460609#L25 assume !(~n <= 0); 1455591#L26 call #t~ret0 := fact(~n - 1);< 1468921#$Ultimate##0 ~n := #in~n; 1455697#L25 assume ~n <= 0;#res := 1; 1455698#factFINAL assume true; 1468949#factEXIT >#70#return; 1468947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1468946#factFINAL assume true; 1468944#factEXIT >#70#return; 1468942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1468941#factFINAL assume true; 1468936#factEXIT >#70#return; 1468937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469135#factFINAL assume true; 1469066#factEXIT >#70#return; 1469067#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469134#factFINAL assume true; 1469132#factEXIT >#70#return; 1469129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469125#factFINAL assume true; 1469121#factEXIT >#70#return; 1469122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469137#factFINAL assume true; 1469103#factEXIT >#70#return; 1469104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469138#factFINAL assume true; 1469136#factEXIT >#70#return; 1469133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469131#factFINAL assume true; 1455588#factEXIT >#70#return; 1455605#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469142#factFINAL assume true; 1469096#factEXIT >#70#return; 1455689#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1455614#factFINAL assume true; 1455618#factEXIT >#70#return; 1469141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469140#factFINAL assume true; 1469139#factEXIT >#70#return; 1469118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469117#factFINAL assume true; 1469113#factEXIT >#70#return; 1469111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469109#factFINAL assume true; 1469108#factEXIT >#70#return; 1469107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469105#factFINAL assume true; 1469101#factEXIT >#70#return; 1469099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469097#factFINAL assume true; 1469094#factEXIT >#70#return; 1469092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1469090#factFINAL assume true; 1469089#factEXIT >#76#return; 1460556#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1460559#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1461132#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1461131#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1461130#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1460363#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1460335#$Ultimate##0 ~n := #in~n; 1460405#L25 assume !(~n <= 0); 1460406#L26 call #t~ret0 := fact(~n - 1);< 1460653#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1460778#L25 assume ~n <= 0;#res := 1; 1460774#factFINAL assume true; 1460764#factEXIT >#70#return; 1460744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460726#factFINAL assume true; 1460635#factEXIT >#70#return; 1460646#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460657#factFINAL assume true; 1460660#factEXIT >#70#return; 1460706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460709#factFINAL assume true; 1460699#factEXIT >#70#return; 1460704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461077#factFINAL assume true; 1460804#factEXIT >#70#return; 1460805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461012#factFINAL assume true; 1460794#factEXIT >#70#return; 1460796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461426#factFINAL assume true; 1461424#factEXIT >#70#return; 1461423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461422#factFINAL assume true; 1460670#factEXIT >#70#return; 1460681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461445#factFINAL assume true; 1461442#factEXIT >#70#return; 1461443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461574#factFINAL assume true; 1460815#factEXIT >#70#return; 1460821#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461573#factFINAL assume true; 1461572#factEXIT >#70#return; 1461571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461570#factFINAL assume true; 1461569#factEXIT >#70#return; 1461568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461567#factFINAL assume true; 1461566#factEXIT >#70#return; 1461565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461522#factFINAL assume true; 1461121#factEXIT >#70#return; 1461119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461117#factFINAL assume true; 1461027#factEXIT >#72#return; 1460343#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1460335#$Ultimate##0 ~n := #in~n; 1460405#L25 assume !(~n <= 0); 1460406#L26 call #t~ret0 := fact(~n - 1);< 1460653#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1460778#L25 assume ~n <= 0;#res := 1; 1460774#factFINAL assume true; 1460764#factEXIT >#70#return; 1460744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460726#factFINAL assume true; 1460635#factEXIT >#70#return; 1460646#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460657#factFINAL assume true; 1460660#factEXIT >#70#return; 1460697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460695#factFINAL assume true; 1460694#factEXIT >#74#return; 1460687#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1460601#$Ultimate##0 ~n := #in~n; 1461347#L25 assume !(~n <= 0); 1460685#L26 call #t~ret0 := fact(~n - 1);< 1460690#$Ultimate##0 ~n := #in~n; 1461387#L25 assume !(~n <= 0); 1460818#L26 call #t~ret0 := fact(~n - 1);< 1461375#$Ultimate##0 ~n := #in~n; 1461373#L25 assume !(~n <= 0); 1460672#L26 call #t~ret0 := fact(~n - 1);< 1461370#$Ultimate##0 ~n := #in~n; 1461368#L25 assume !(~n <= 0); 1460678#L26 call #t~ret0 := fact(~n - 1);< 1461365#$Ultimate##0 ~n := #in~n; 1461363#L25 assume !(~n <= 0); 1460674#L26 call #t~ret0 := fact(~n - 1);< 1461013#$Ultimate##0 ~n := #in~n; 1461106#L25 assume !(~n <= 0); 1460679#L26 call #t~ret0 := fact(~n - 1);< 1460797#$Ultimate##0 ~n := #in~n; 1461114#L25 assume !(~n <= 0); 1460673#L26 call #t~ret0 := fact(~n - 1);< 1461015#$Ultimate##0 ~n := #in~n; 1461019#L25 assume !(~n <= 0); 1460659#L26 call #t~ret0 := fact(~n - 1);< 1461016#$Ultimate##0 ~n := #in~n; 1461137#L25 assume !(~n <= 0); 1460643#L26 call #t~ret0 := fact(~n - 1);< 1461017#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1460778#L25 assume ~n <= 0;#res := 1; 1460774#factFINAL assume true; 1460764#factEXIT >#70#return; 1460744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460726#factFINAL assume true; 1460635#factEXIT >#70#return; 1460646#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460657#factFINAL assume true; 1460660#factEXIT >#70#return; 1460706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460709#factFINAL assume true; 1460699#factEXIT >#70#return; 1460704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461077#factFINAL assume true; 1460804#factEXIT >#70#return; 1460805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461012#factFINAL assume true; 1460794#factEXIT >#70#return; 1460796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461426#factFINAL assume true; 1461424#factEXIT >#70#return; 1461423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461422#factFINAL assume true; 1460670#factEXIT >#70#return; 1460681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461445#factFINAL assume true; 1461442#factEXIT >#70#return; 1461443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461574#factFINAL assume true; 1460815#factEXIT >#70#return; 1460820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1461446#factFINAL assume true; 1461435#factEXIT >#76#return; 1460576#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1461098#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1461097#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1461096#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1461094#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1460387#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1460335#$Ultimate##0 ~n := #in~n; 1460405#L25 assume !(~n <= 0); 1460406#L26 call #t~ret0 := fact(~n - 1);< 1460653#$Ultimate##0 ~n := #in~n; 1461107#L25 assume !(~n <= 0); 1460637#L26 call #t~ret0 := fact(~n - 1);< 1461014#$Ultimate##0 ~n := #in~n; 1460778#L25 assume ~n <= 0;#res := 1; 1460774#factFINAL assume true; 1460764#factEXIT >#70#return; 1460744#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460726#factFINAL assume true; 1460635#factEXIT >#70#return; 1460648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1460786#factFINAL assume true; 1460777#factEXIT >#72#return; 1460663#L30-1 [2023-11-29 01:19:50,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash 334459417, now seen corresponding path program 19 times [2023-11-29 01:19:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:19:50,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290312568] [2023-11-29 01:19:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:19:50,379 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:19:50,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132617964] [2023-11-29 01:19:50,379 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:19:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:19:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:19:50,381 INFO L229 MonitoredProcess]: Starting monitored process 575 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:19:50,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (575)] Waiting until timeout for monitored process [2023-11-29 01:19:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:52,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:19:52,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14251 backedges. 6727 proven. 134 refuted. 0 times theorem prover too weak. 7390 trivial. 0 not checked. [2023-11-29 01:19:52,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14251 backedges. 191 proven. 134 refuted. 0 times theorem prover too weak. 13926 trivial. 0 not checked. [2023-11-29 01:19:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:19:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290312568] [2023-11-29 01:19:52,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:19:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132617964] [2023-11-29 01:19:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132617964] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:19:52,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:19:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-11-29 01:19:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763810421] [2023-11-29 01:19:52,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:19:52,841 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:19:52,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1004157372, now seen corresponding path program 13 times [2023-11-29 01:19:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:19:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32969943] [2023-11-29 01:19:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:19:52,882 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:19:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582762080] [2023-11-29 01:19:52,882 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:19:52,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:19:52,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:19:52,884 INFO L229 MonitoredProcess]: Starting monitored process 576 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:19:52,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (576)] Waiting until timeout for monitored process [2023-11-29 01:19:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:54,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 01:19:54,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25321 backedges. 6537 proven. 160 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2023-11-29 01:19:54,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 25321 backedges. 177 proven. 3149 refuted. 0 times theorem prover too weak. 21995 trivial. 0 not checked. [2023-11-29 01:19:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:19:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32969943] [2023-11-29 01:19:56,245 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:19:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582762080] [2023-11-29 01:19:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582762080] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:19:56,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:19:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2023-11-29 01:19:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046252996] [2023-11-29 01:19:56,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:19:56,247 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:19:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:19:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:19:56,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:19:56,248 INFO L87 Difference]: Start difference. First operand 13561 states and 37898 transitions. cyclomatic complexity: 24424 Second operand has 18 states, 18 states have (on average 5.222222222222222) internal successors, (94), 18 states have internal predecessors, (94), 14 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 14 states have call predecessors, (50), 14 states have call successors, (50) [2023-11-29 01:19:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:19:56,729 INFO L93 Difference]: Finished difference Result 14036 states and 39532 transitions. [2023-11-29 01:19:56,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14036 states and 39532 transitions. [2023-11-29 01:19:56,878 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1523 [2023-11-29 01:19:57,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14036 states to 13561 states and 37886 transitions. [2023-11-29 01:19:57,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2625 [2023-11-29 01:19:57,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2625 [2023-11-29 01:19:57,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13561 states and 37886 transitions. [2023-11-29 01:19:57,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:19:57,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13561 states and 37886 transitions. [2023-11-29 01:19:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states and 37886 transitions. [2023-11-29 01:19:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13530. [2023-11-29 01:19:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13530 states, 7927 states have (on average 1.023968714519995) internal successors, (8117), 7873 states have internal predecessors, (8117), 3905 states have call successors, (4386), 1775 states have call predecessors, (4386), 1698 states have return successors, (25323), 3881 states have call predecessors, (25323), 3905 states have call successors, (25323) [2023-11-29 01:19:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13530 states to 13530 states and 37826 transitions. [2023-11-29 01:19:57,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13530 states and 37826 transitions. [2023-11-29 01:19:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:19:57,750 INFO L428 stractBuchiCegarLoop]: Abstraction has 13530 states and 37826 transitions. [2023-11-29 01:19:57,750 INFO L335 stractBuchiCegarLoop]: ======== Iteration 58 ============ [2023-11-29 01:19:57,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13530 states and 37826 transitions. [2023-11-29 01:19:57,812 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1523 [2023-11-29 01:19:57,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:19:57,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:19:57,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [93, 93, 54, 54, 54, 54, 39, 13, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:19:57,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [98, 98, 83, 83, 83, 83, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:19:57,816 INFO L748 eck$LassoCheckResult]: Stem: 1489961#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1489884#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1489885#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1489903#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1489962#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1490547#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1490545#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1490541#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1490542#$Ultimate##0 ~n := #in~n; 1490546#L25 assume ~n <= 0;#res := 1; 1490544#factFINAL assume true; 1490540#factEXIT >#72#return; 1490536#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1490537#$Ultimate##0 ~n := #in~n; 1490543#L25 assume ~n <= 0;#res := 1; 1490539#factFINAL assume true; 1490535#factEXIT >#74#return; 1490532#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1490533#$Ultimate##0 ~n := #in~n; 1490538#L25 assume ~n <= 0;#res := 1; 1490534#factFINAL assume true; 1490531#factEXIT >#76#return; 1490530#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1490528#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1490525#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1490521#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1490519#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1490515#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1490516#$Ultimate##0 ~n := #in~n; 1490527#L25 assume !(~n <= 0); 1490523#L26 call #t~ret0 := fact(~n - 1);< 1490524#$Ultimate##0 ~n := #in~n; 1490529#L25 assume ~n <= 0;#res := 1; 1490526#factFINAL assume true; 1490522#factEXIT >#70#return; 1490520#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490518#factFINAL assume true; 1490514#factEXIT >#78#return; 1490511#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1490512#$Ultimate##0 ~n := #in~n; 1490517#L25 assume ~n <= 0;#res := 1; 1490513#factFINAL assume true; 1490510#factEXIT >#80#return; 1490508#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1490509#$Ultimate##0 ~n := #in~n; 1490564#L25 assume !(~n <= 0); 1490562#L26 call #t~ret0 := fact(~n - 1);< 1490563#$Ultimate##0 ~n := #in~n; 1491111#L25 assume ~n <= 0;#res := 1; 1491107#factFINAL assume true; 1490560#factEXIT >#70#return; 1490553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490549#factFINAL assume true; 1490507#factEXIT >#82#return; 1490482#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1490476#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1490450#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1490448#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1490440#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1490190#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1490195#$Ultimate##0 ~n := #in~n; 1490214#L25 assume !(~n <= 0); 1490203#L26 call #t~ret0 := fact(~n - 1);< 1490209#$Ultimate##0 ~n := #in~n; 1490224#L25 assume !(~n <= 0); 1490206#L26 call #t~ret0 := fact(~n - 1);< 1490219#$Ultimate##0 ~n := #in~n; 1490225#L25 assume ~n <= 0;#res := 1; 1490223#factFINAL assume true; 1490218#factEXIT >#70#return; 1490216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490211#factFINAL assume true; 1490202#factEXIT >#70#return; 1490200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490198#factFINAL assume true; 1490189#factEXIT >#78#return; 1490193#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1490335#$Ultimate##0 ~n := #in~n; 1490395#L25 assume ~n <= 0;#res := 1; 1490390#factFINAL assume true; 1490388#factEXIT >#80#return; 1490377#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1490380#$Ultimate##0 ~n := #in~n; 1490397#L25 assume !(~n <= 0); 1490316#L26 call #t~ret0 := fact(~n - 1);< 1490370#$Ultimate##0 ~n := #in~n; 1490413#L25 assume !(~n <= 0); 1490314#L26 call #t~ret0 := fact(~n - 1);< 1490409#$Ultimate##0 ~n := #in~n; 1490414#L25 assume ~n <= 0;#res := 1; 1490412#factFINAL assume true; 1490408#factEXIT >#70#return; 1490398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490396#factFINAL assume true; 1490391#factEXIT >#70#return; 1490392#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490394#factFINAL assume true; 1490393#factEXIT >#82#return; 1490379#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1490386#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1490385#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1490384#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1490382#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1490232#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1490236#$Ultimate##0 ~n := #in~n; 1490372#L25 assume !(~n <= 0); 1490317#L26 call #t~ret0 := fact(~n - 1);< 1490370#$Ultimate##0 ~n := #in~n; 1490413#L25 assume !(~n <= 0); 1490314#L26 call #t~ret0 := fact(~n - 1);< 1490409#$Ultimate##0 ~n := #in~n; 1490413#L25 assume !(~n <= 0); 1490314#L26 call #t~ret0 := fact(~n - 1);< 1490409#$Ultimate##0 ~n := #in~n; 1490414#L25 assume ~n <= 0;#res := 1; 1490412#factFINAL assume true; 1490408#factEXIT >#70#return; 1490398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490396#factFINAL assume true; 1490391#factEXIT >#70#return; 1490389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490381#factFINAL assume true; 1490368#factEXIT >#70#return; 1490346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490331#factFINAL assume true; 1490231#factEXIT >#78#return; 1490235#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1490252#$Ultimate##0 ~n := #in~n; 1490287#L25 assume ~n <= 0;#res := 1; 1490286#factFINAL assume true; 1490284#factEXIT >#80#return; 1490282#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1490283#$Ultimate##0 ~n := #in~n; 1490292#L25 assume !(~n <= 0); 1490273#L26 call #t~ret0 := fact(~n - 1);< 1490291#$Ultimate##0 ~n := #in~n; 1490323#L25 assume !(~n <= 0); 1490274#L26 call #t~ret0 := fact(~n - 1);< 1490277#$Ultimate##0 ~n := #in~n; 1490305#L25 assume !(~n <= 0); 1490271#L26 call #t~ret0 := fact(~n - 1);< 1490304#$Ultimate##0 ~n := #in~n; 1490308#L25 assume ~n <= 0;#res := 1; 1490306#factFINAL assume true; 1490303#factEXIT >#70#return; 1490301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490300#factFINAL assume true; 1490297#factEXIT >#70#return; 1490296#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490293#factFINAL assume true; 1490289#factEXIT >#70#return; 1490275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490288#factFINAL assume true; 1490281#factEXIT >#82#return; 1490280#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1490278#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1490268#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1490266#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1490265#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1490261#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1490262#$Ultimate##0 ~n := #in~n; 1490279#L25 assume !(~n <= 0); 1490272#L26 call #t~ret0 := fact(~n - 1);< 1490277#$Ultimate##0 ~n := #in~n; 1490305#L25 assume !(~n <= 0); 1490271#L26 call #t~ret0 := fact(~n - 1);< 1490304#$Ultimate##0 ~n := #in~n; 1490305#L25 assume !(~n <= 0); 1490271#L26 call #t~ret0 := fact(~n - 1);< 1490304#$Ultimate##0 ~n := #in~n; 1490305#L25 assume !(~n <= 0); 1490271#L26 call #t~ret0 := fact(~n - 1);< 1490304#$Ultimate##0 ~n := #in~n; 1490308#L25 assume ~n <= 0;#res := 1; 1490306#factFINAL assume true; 1490303#factEXIT >#70#return; 1490301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490300#factFINAL assume true; 1490297#factEXIT >#70#return; 1490296#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490293#factFINAL assume true; 1490289#factEXIT >#70#return; 1490290#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490302#factFINAL assume true; 1490269#factEXIT >#70#return; 1490267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1490264#factFINAL assume true; 1490259#factEXIT >#78#return; 1490256#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1490257#$Ultimate##0 ~n := #in~n; 1492000#L25 assume ~n <= 0;#res := 1; 1491999#factFINAL assume true; 1491998#factEXIT >#80#return; 1491944#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1491997#$Ultimate##0 ~n := #in~n; 1491996#L25 assume !(~n <= 0); 1491135#L26 call #t~ret0 := fact(~n - 1);< 1491932#$Ultimate##0 ~n := #in~n; 1492078#L25 assume !(~n <= 0); 1491142#L26 call #t~ret0 := fact(~n - 1);< 1491949#$Ultimate##0 ~n := #in~n; 1491964#L25 assume !(~n <= 0); 1491131#L26 call #t~ret0 := fact(~n - 1);< 1491219#$Ultimate##0 ~n := #in~n; 1491970#L25 assume !(~n <= 0); 1491136#L26 call #t~ret0 := fact(~n - 1);< 1491969#$Ultimate##0 ~n := #in~n; 1491976#L25 assume ~n <= 0;#res := 1; 1491974#factFINAL assume true; 1491968#factEXIT >#70#return; 1491967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1491965#factFINAL assume true; 1491956#factEXIT >#70#return; 1491955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1491951#factFINAL assume true; 1491947#factEXIT >#70#return; 1491946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1491943#factFINAL assume true; 1491936#factEXIT >#70#return; 1491937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494733#factFINAL assume true; 1494727#factEXIT >#82#return; 1491675#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1494723#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1494722#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1494721#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1489972#L42-4 havoc main_~k~0#1; 1494717#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1494713#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1494710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1494708#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1494648#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1494699#$Ultimate##0 ~n := #in~n; 1494716#L25 assume !(~n <= 0); 1489829#L26 call #t~ret0 := fact(~n - 1);< 1494712#$Ultimate##0 ~n := #in~n; 1494718#L25 assume ~n <= 0;#res := 1; 1494714#factFINAL assume true; 1494711#factEXIT >#70#return; 1494709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494707#factFINAL assume true; 1494700#factEXIT >#72#return; 1494651#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1494697#$Ultimate##0 ~n := #in~n; 1494706#L25 assume ~n <= 0;#res := 1; 1494698#factFINAL assume true; 1494647#factEXIT >#74#return; 1489912#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1494646#$Ultimate##0 ~n := #in~n; 1494772#L25 assume !(~n <= 0); 1494769#L26 call #t~ret0 := fact(~n - 1);< 1494770#$Ultimate##0 ~n := #in~n; 1494773#L25 assume ~n <= 0;#res := 1; 1494771#factFINAL assume true; 1494768#factEXIT >#70#return; 1494767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494766#factFINAL assume true; 1494645#factEXIT >#76#return; 1494643#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1494644#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1495495#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1495494#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1495493#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1495066#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1495224#$Ultimate##0 ~n := #in~n; 1495406#L25 assume !(~n <= 0); 1494953#L26 call #t~ret0 := fact(~n - 1);< 1495404#$Ultimate##0 ~n := #in~n; 1495008#L25 assume ~n <= 0;#res := 1; 1494975#factFINAL assume true; 1494950#factEXIT >#70#return; 1494958#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1495492#factFINAL assume true; 1495060#factEXIT >#72#return; 1494531#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1494636#$Ultimate##0 ~n := #in~n; 1494637#L25 assume !(~n <= 0); 1494633#L26 call #t~ret0 := fact(~n - 1);< 1494634#$Ultimate##0 ~n := #in~n; 1495008#L25 assume ~n <= 0;#res := 1; 1494975#factFINAL assume true; 1494950#factEXIT >#70#return; 1494945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494940#factFINAL assume true; 1494526#factEXIT >#74#return; 1494516#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1494871#$Ultimate##0 ~n := #in~n; 1494869#L25 assume ~n <= 0;#res := 1; 1494504#factFINAL assume true; 1494520#factEXIT >#76#return; 1494499#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1497167#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1497166#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1497165#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1497164#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1494908#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1494943#$Ultimate##0 ~n := #in~n; 1494938#L25 assume !(~n <= 0); 1494617#L26 call #t~ret0 := fact(~n - 1);< 1494863#$Ultimate##0 ~n := #in~n; 1495465#L25 assume !(~n <= 0); 1494618#L26 call #t~ret0 := fact(~n - 1);< 1495044#$Ultimate##0 ~n := #in~n; 1494911#L25 assume ~n <= 0;#res := 1; 1494896#factFINAL assume true; 1494887#factEXIT >#70#return; 1494889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494874#factFINAL assume true; 1494876#factEXIT >#70#return; 1494891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1495734#factFINAL assume true; 1495721#factEXIT >#78#return; 1494868#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1495786#$Ultimate##0 ~n := #in~n; 1497170#L25 assume !(~n <= 0); 1496951#L26 call #t~ret0 := fact(~n - 1);< 1496977#$Ultimate##0 ~n := #in~n; 1496476#L25 assume ~n <= 0;#res := 1; 1496957#factFINAL assume true; 1496948#factEXIT >#70#return; 1496954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497168#factFINAL assume true; 1497148#factEXIT >#80#return; 1497142#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1497146#$Ultimate##0 ~n := #in~n; 1497160#L25 assume !(~n <= 0); 1496949#L26 call #t~ret0 := fact(~n - 1);< 1496977#$Ultimate##0 ~n := #in~n; 1496476#L25 assume ~n <= 0;#res := 1; 1496957#factFINAL assume true; 1496948#factEXIT >#70#return; 1496952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497147#factFINAL assume true; 1497135#factEXIT >#82#return; 1497145#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1497169#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1497156#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1497154#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1497152#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1496009#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1496194#$Ultimate##0 ~n := #in~n; 1496632#L25 assume !(~n <= 0); 1496215#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496193#factFINAL assume true; 1495796#factEXIT >#78#return; 1496164#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1496544#$Ultimate##0 ~n := #in~n; 1496518#L25 assume !(~n <= 0); 1496453#L26 call #t~ret0 := fact(~n - 1);< 1496463#$Ultimate##0 ~n := #in~n; 1496476#L25 assume ~n <= 0;#res := 1; 1496957#factFINAL assume true; 1496948#factEXIT >#70#return; 1496947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496946#factFINAL assume true; 1496927#factEXIT >#80#return; 1495836#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1496192#$Ultimate##0 ~n := #in~n; 1497027#L25 assume !(~n <= 0); 1496218#L26 call #t~ret0 := fact(~n - 1);< 1496468#$Ultimate##0 ~n := #in~n; 1496465#L25 assume !(~n <= 0); 1496455#L26 call #t~ret0 := fact(~n - 1);< 1496461#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497079#factFINAL assume true; 1497078#factEXIT >#82#return; 1496133#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1497586#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1497585#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1497584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1497583#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1495852#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1496194#$Ultimate##0 ~n := #in~n; 1496632#L25 assume !(~n <= 0); 1496215#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497087#factFINAL assume true; 1497083#factEXIT >#70#return; 1497082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497081#factFINAL assume true; 1497080#factEXIT >#78#return; 1496035#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1496194#$Ultimate##0 ~n := #in~n; 1496632#L25 assume !(~n <= 0); 1496215#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497079#factFINAL assume true; 1497078#factEXIT >#80#return; 1496106#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1496542#$Ultimate##0 ~n := #in~n; 1496497#L25 assume !(~n <= 0); 1496198#L26 call #t~ret0 := fact(~n - 1);< 1496955#$Ultimate##0 ~n := #in~n; 1496465#L25 assume !(~n <= 0); 1496455#L26 call #t~ret0 := fact(~n - 1);< 1496461#$Ultimate##0 ~n := #in~n; 1496474#L25 assume !(~n <= 0); 1496470#L26 call #t~ret0 := fact(~n - 1);< 1496472#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496193#factFINAL assume true; 1495796#factEXIT >#82#return; 1496190#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1497545#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1497541#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1497535#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1495594#L42-4 havoc main_~k~0#1; 1495593#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1495592#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1495591#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1495590#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1494702#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1494719#$Ultimate##0 ~n := #in~n; 1494715#L25 assume !(~n <= 0); 1489829#L26 call #t~ret0 := fact(~n - 1);< 1494712#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494745#L25 assume ~n <= 0;#res := 1; 1494746#factFINAL assume true; 1494744#factEXIT >#70#return; 1494743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494741#factFINAL assume true; 1494739#factEXIT >#70#return; 1494738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494737#factFINAL assume true; 1494736#factEXIT >#72#return; 1494685#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1494697#$Ultimate##0 ~n := #in~n; 1494706#L25 assume ~n <= 0;#res := 1; 1494698#factFINAL assume true; 1494647#factEXIT >#74#return; 1489928#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1495589#$Ultimate##0 ~n := #in~n; 1503028#L25 assume !(~n <= 0); 1503015#L26 call #t~ret0 := fact(~n - 1);< 1503023#$Ultimate##0 ~n := #in~n; 1494774#L25 assume !(~n <= 0); 1489945#L26 call #t~ret0 := fact(~n - 1);< 1503013#$Ultimate##0 ~n := #in~n; 1489944#L25 assume ~n <= 0;#res := 1; 1489946#factFINAL assume true; 1503210#factEXIT >#70#return; 1503208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503206#factFINAL assume true; 1503204#factEXIT >#70#return; 1503205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503241#factFINAL assume true; 1494761#factEXIT >#76#return; 1494762#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1495588#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1495586#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1495584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1495582#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1495074#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1495224#$Ultimate##0 ~n := #in~n; 1495406#L25 assume !(~n <= 0); 1494953#L26 call #t~ret0 := fact(~n - 1);< 1495404#$Ultimate##0 ~n := #in~n; 1495522#L25 assume !(~n <= 0); 1495398#L26 call #t~ret0 := fact(~n - 1);< 1495520#$Ultimate##0 ~n := #in~n; 1495482#L25 assume ~n <= 0;#res := 1; 1495483#factFINAL assume true; 1495477#factEXIT >#70#return; 1495476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1495474#factFINAL assume true; 1495457#factEXIT >#70#return; 1495459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1495547#factFINAL assume true; 1495277#factEXIT >#72#return; 1494536#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1494636#$Ultimate##0 ~n := #in~n; 1494637#L25 assume !(~n <= 0); 1494633#L26 call #t~ret0 := fact(~n - 1);< 1494634#$Ultimate##0 ~n := #in~n; 1495008#L25 assume ~n <= 0;#res := 1; 1494975#factFINAL assume true; 1494950#factEXIT >#70#return; 1494945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494940#factFINAL assume true; 1494526#factEXIT >#74#return; 1494512#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1494872#$Ultimate##0 ~n := #in~n; 1495732#L25 assume !(~n <= 0); 1494955#L26 call #t~ret0 := fact(~n - 1);< 1494976#$Ultimate##0 ~n := #in~n; 1495008#L25 assume ~n <= 0;#res := 1; 1494975#factFINAL assume true; 1494950#factEXIT >#70#return; 1494959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1495565#factFINAL assume true; 1495348#factEXIT >#76#return; 1495358#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1495380#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1495379#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1495377#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1495369#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1495149#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1495224#$Ultimate##0 ~n := #in~n; 1495406#L25 assume !(~n <= 0); 1494953#L26 call #t~ret0 := fact(~n - 1);< 1495404#$Ultimate##0 ~n := #in~n; 1495522#L25 assume !(~n <= 0); 1495398#L26 call #t~ret0 := fact(~n - 1);< 1495520#$Ultimate##0 ~n := #in~n; 1495482#L25 assume ~n <= 0;#res := 1; 1495483#factFINAL assume true; 1495477#factEXIT >#70#return; 1495476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1495474#factFINAL assume true; 1495457#factEXIT >#70#return; 1495459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1495547#factFINAL assume true; 1495277#factEXIT >#72#return; 1494529#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1494873#$Ultimate##0 ~n := #in~n; 1497725#L25 assume !(~n <= 0); 1497720#L26 call #t~ret0 := fact(~n - 1);< 1497724#$Ultimate##0 ~n := #in~n; 1497728#L25 assume ~n <= 0;#res := 1; 1497726#factFINAL assume true; 1497713#factEXIT >#70#return; 1497712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497709#factFINAL assume true; 1497589#factEXIT >#74#return; 1496972#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1497173#$Ultimate##0 ~n := #in~n; 1497171#L25 assume ~n <= 0;#res := 1; 1497172#factFINAL assume true; 1497575#factEXIT >#76#return; 1497551#L30-3 [2023-11-29 01:19:57,817 INFO L750 eck$LassoCheckResult]: Loop: 1497551#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1497550#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1497544#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1497540#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1497534#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1496065#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1496194#$Ultimate##0 ~n := #in~n; 1496632#L25 assume !(~n <= 0); 1496215#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496193#factFINAL assume true; 1495796#factEXIT >#78#return; 1496176#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1496544#$Ultimate##0 ~n := #in~n; 1496518#L25 assume !(~n <= 0); 1496453#L26 call #t~ret0 := fact(~n - 1);< 1496463#$Ultimate##0 ~n := #in~n; 1496476#L25 assume ~n <= 0;#res := 1; 1496957#factFINAL assume true; 1496948#factEXIT >#70#return; 1496947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496946#factFINAL assume true; 1496927#factEXIT >#80#return; 1495963#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1496192#$Ultimate##0 ~n := #in~n; 1497027#L25 assume !(~n <= 0); 1496218#L26 call #t~ret0 := fact(~n - 1);< 1496468#$Ultimate##0 ~n := #in~n; 1496465#L25 assume !(~n <= 0); 1496455#L26 call #t~ret0 := fact(~n - 1);< 1496461#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497079#factFINAL assume true; 1497078#factEXIT >#82#return; 1496161#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1503069#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1503068#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1503067#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1503066#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1496068#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1496194#$Ultimate##0 ~n := #in~n; 1496632#L25 assume !(~n <= 0); 1496215#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497087#factFINAL assume true; 1497083#factEXIT >#70#return; 1497082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497081#factFINAL assume true; 1497080#factEXIT >#78#return; 1496066#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1496194#$Ultimate##0 ~n := #in~n; 1496632#L25 assume !(~n <= 0); 1496215#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497079#factFINAL assume true; 1497078#factEXIT >#80#return; 1496084#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1496542#$Ultimate##0 ~n := #in~n; 1496497#L25 assume !(~n <= 0); 1496198#L26 call #t~ret0 := fact(~n - 1);< 1496955#$Ultimate##0 ~n := #in~n; 1496465#L25 assume !(~n <= 0); 1496455#L26 call #t~ret0 := fact(~n - 1);< 1496461#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497079#factFINAL assume true; 1497078#factEXIT >#82#return; 1496187#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1503061#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1503060#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1499434#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1489970#L42-4 havoc main_~k~0#1; 1489902#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1489896#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1489897#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1494747#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1494705#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1494719#$Ultimate##0 ~n := #in~n; 1494715#L25 assume !(~n <= 0); 1489829#L26 call #t~ret0 := fact(~n - 1);< 1494712#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494720#L25 assume !(~n <= 0); 1489830#L26 call #t~ret0 := fact(~n - 1);< 1494742#$Ultimate##0 ~n := #in~n; 1494745#L25 assume ~n <= 0;#res := 1; 1494746#factFINAL assume true; 1494744#factEXIT >#70#return; 1494743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1494741#factFINAL assume true; 1494739#factEXIT >#70#return; 1494740#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503138#factFINAL assume true; 1503136#factEXIT >#70#return; 1503135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503134#factFINAL assume true; 1503127#factEXIT >#70#return; 1503125#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503124#factFINAL assume true; 1503122#factEXIT >#70#return; 1503121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503120#factFINAL assume true; 1503118#factEXIT >#70#return; 1503119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503212#factFINAL assume true; 1503211#factEXIT >#70#return; 1503209#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503207#factFINAL assume true; 1503202#factEXIT >#70#return; 1503200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503198#factFINAL assume true; 1503196#factEXIT >#70#return; 1503197#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1489840#factFINAL assume true; 1489841#factEXIT >#70#return; 1503189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503342#factFINAL assume true; 1503340#factEXIT >#70#return; 1503339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503337#factFINAL assume true; 1503336#factEXIT >#70#return; 1503335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503334#factFINAL assume true; 1503271#factEXIT >#70#return; 1503269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503267#factFINAL assume true; 1503265#factEXIT >#70#return; 1503266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503341#factFINAL assume true; 1503338#factEXIT >#72#return; 1494676#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1494699#$Ultimate##0 ~n := #in~n; 1494716#L25 assume ~n <= 0;#res := 1; 1494698#factFINAL assume true; 1494647#factEXIT >#74#return; 1489937#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1503251#$Ultimate##0 ~n := #in~n; 1503249#L25 assume !(~n <= 0); 1503242#L26 call #t~ret0 := fact(~n - 1);< 1503246#$Ultimate##0 ~n := #in~n; 1503244#L25 assume !(~n <= 0); 1503238#L26 call #t~ret0 := fact(~n - 1);< 1503240#$Ultimate##0 ~n := #in~n; 1503239#L25 assume !(~n <= 0); 1503235#L26 call #t~ret0 := fact(~n - 1);< 1503237#$Ultimate##0 ~n := #in~n; 1503236#L25 assume !(~n <= 0); 1503231#L26 call #t~ret0 := fact(~n - 1);< 1503233#$Ultimate##0 ~n := #in~n; 1503232#L25 assume !(~n <= 0); 1503176#L26 call #t~ret0 := fact(~n - 1);< 1503181#$Ultimate##0 ~n := #in~n; 1503179#L25 assume !(~n <= 0); 1503170#L26 call #t~ret0 := fact(~n - 1);< 1503174#$Ultimate##0 ~n := #in~n; 1503172#L25 assume !(~n <= 0); 1503163#L26 call #t~ret0 := fact(~n - 1);< 1503167#$Ultimate##0 ~n := #in~n; 1503166#L25 assume !(~n <= 0); 1503158#L26 call #t~ret0 := fact(~n - 1);< 1503161#$Ultimate##0 ~n := #in~n; 1503159#L25 assume !(~n <= 0); 1503044#L26 call #t~ret0 := fact(~n - 1);< 1503050#$Ultimate##0 ~n := #in~n; 1503047#L25 assume !(~n <= 0); 1503036#L26 call #t~ret0 := fact(~n - 1);< 1503039#$Ultimate##0 ~n := #in~n; 1503038#L25 assume !(~n <= 0); 1503032#L26 call #t~ret0 := fact(~n - 1);< 1503035#$Ultimate##0 ~n := #in~n; 1503033#L25 assume !(~n <= 0); 1503025#L26 call #t~ret0 := fact(~n - 1);< 1503029#$Ultimate##0 ~n := #in~n; 1503027#L25 assume !(~n <= 0); 1503016#L26 call #t~ret0 := fact(~n - 1);< 1503024#$Ultimate##0 ~n := #in~n; 1494774#L25 assume !(~n <= 0); 1489945#L26 call #t~ret0 := fact(~n - 1);< 1503013#$Ultimate##0 ~n := #in~n; 1494774#L25 assume !(~n <= 0); 1489945#L26 call #t~ret0 := fact(~n - 1);< 1503013#$Ultimate##0 ~n := #in~n; 1489944#L25 assume ~n <= 0;#res := 1; 1489946#factFINAL assume true; 1503210#factEXIT >#70#return; 1503208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503206#factFINAL assume true; 1503204#factEXIT >#70#return; 1503201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503199#factFINAL assume true; 1503194#factEXIT >#70#return; 1503195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503234#factFINAL assume true; 1503173#factEXIT >#70#return; 1503171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503168#factFINAL assume true; 1503164#factEXIT >#70#return; 1503162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503156#factFINAL assume true; 1503152#factEXIT >#70#return; 1503153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503230#factFINAL assume true; 1503229#factEXIT >#70#return; 1503228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503227#factFINAL assume true; 1503225#factEXIT >#70#return; 1503224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503223#factFINAL assume true; 1503220#factEXIT >#70#return; 1503221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503303#factFINAL assume true; 1503302#factEXIT >#70#return; 1503301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503300#factFINAL assume true; 1503299#factEXIT >#70#return; 1503298#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503297#factFINAL assume true; 1503294#factEXIT >#70#return; 1503291#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503290#factFINAL assume true; 1503286#factEXIT >#70#return; 1503285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503283#factFINAL assume true; 1503281#factEXIT >#70#return; 1503278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503274#factFINAL assume true; 1503272#factEXIT >#70#return; 1503270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1503268#factFINAL assume true; 1503254#factEXIT >#76#return; 1494756#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1494758#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1498038#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1498034#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1498033#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1497830#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1489883#$Ultimate##0 ~n := #in~n; 1498242#L25 assume !(~n <= 0); 1497714#L26 call #t~ret0 := fact(~n - 1);< 1498240#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498674#L25 assume !(~n <= 0); 1498224#L26 call #t~ret0 := fact(~n - 1);< 1498667#$Ultimate##0 ~n := #in~n; 1498700#L25 assume ~n <= 0;#res := 1; 1498701#factFINAL assume true; 1498664#factEXIT >#70#return; 1498663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498662#factFINAL assume true; 1498652#factEXIT >#70#return; 1498650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498618#factFINAL assume true; 1498538#factEXIT >#70#return; 1498543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498597#factFINAL assume true; 1498592#factEXIT >#70#return; 1498591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498562#factFINAL assume true; 1498390#factEXIT >#70#return; 1498389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498370#factFINAL assume true; 1498361#factEXIT >#70#return; 1498367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1499654#factFINAL assume true; 1499655#factEXIT >#70#return; 1499871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1500152#factFINAL assume true; 1498455#factEXIT >#70#return; 1498457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1500396#factFINAL assume true; 1498483#factEXIT >#70#return; 1498481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498480#factFINAL assume true; 1498209#factEXIT >#72#return; 1497882#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1489883#$Ultimate##0 ~n := #in~n; 1498242#L25 assume !(~n <= 0); 1497714#L26 call #t~ret0 := fact(~n - 1);< 1498240#$Ultimate##0 ~n := #in~n; 1497728#L25 assume ~n <= 0;#res := 1; 1497726#factFINAL assume true; 1497713#factEXIT >#70#return; 1497721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498271#factFINAL assume true; 1497748#factEXIT >#74#return; 1496766#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1496923#$Ultimate##0 ~n := #in~n; 1497225#L25 assume !(~n <= 0); 1496754#L26 call #t~ret0 := fact(~n - 1);< 1496757#$Ultimate##0 ~n := #in~n; 1496755#L25 assume !(~n <= 0); 1496718#L26 call #t~ret0 := fact(~n - 1);< 1496721#$Ultimate##0 ~n := #in~n; 1496719#L25 assume !(~n <= 0); 1496680#L26 call #t~ret0 := fact(~n - 1);< 1496685#$Ultimate##0 ~n := #in~n; 1496683#L25 assume !(~n <= 0); 1496672#L26 call #t~ret0 := fact(~n - 1);< 1496679#$Ultimate##0 ~n := #in~n; 1496671#L25 assume !(~n <= 0); 1496631#L26 call #t~ret0 := fact(~n - 1);< 1497221#$Ultimate##0 ~n := #in~n; 1496630#L25 assume !(~n <= 0); 1496210#L26 call #t~ret0 := fact(~n - 1);< 1496629#$Ultimate##0 ~n := #in~n; 1496551#L25 assume !(~n <= 0); 1496208#L26 call #t~ret0 := fact(~n - 1);< 1496559#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497087#factFINAL assume true; 1497083#factEXIT >#70#return; 1497084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497283#factFINAL assume true; 1497278#factEXIT >#70#return; 1497276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497250#factFINAL assume true; 1497245#factEXIT >#70#return; 1497246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497446#factFINAL assume true; 1497443#factEXIT >#70#return; 1497442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497441#factFINAL assume true; 1497438#factEXIT >#70#return; 1497436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497434#factFINAL assume true; 1497430#factEXIT >#70#return; 1497429#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497421#factFINAL assume true; 1497409#factEXIT >#70#return; 1497406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497402#factFINAL assume true; 1497401#factEXIT >#70#return; 1497395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497394#factFINAL assume true; 1497392#factEXIT >#70#return; 1497388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497385#factFINAL assume true; 1497380#factEXIT >#70#return; 1497376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497373#factFINAL assume true; 1497369#factEXIT >#70#return; 1497365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497362#factFINAL assume true; 1497358#factEXIT >#70#return; 1497348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497301#factFINAL assume true; 1497296#factEXIT >#70#return; 1497186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498194#factFINAL assume true; 1497676#factEXIT >#76#return; 1497598#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1497597#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1497596#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1497595#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1497594#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1496304#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1489881#$Ultimate##0 ~n := #in~n; 1497175#L25 assume !(~n <= 0); 1496197#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497087#factFINAL assume true; 1497083#factEXIT >#70#return; 1497084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497283#factFINAL assume true; 1497278#factEXIT >#70#return; 1497276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497250#factFINAL assume true; 1497245#factEXIT >#70#return; 1497246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497446#factFINAL assume true; 1497443#factEXIT >#70#return; 1497440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498299#factFINAL assume true; 1497590#factEXIT >#72#return; 1496327#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1489881#$Ultimate##0 ~n := #in~n; 1497175#L25 assume !(~n <= 0); 1496197#L26 call #t~ret0 := fact(~n - 1);< 1496446#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1497284#L25 assume !(~n <= 0); 1496209#L26 call #t~ret0 := fact(~n - 1);< 1497222#$Ultimate##0 ~n := #in~n; 1496475#L25 assume ~n <= 0;#res := 1; 1496473#factFINAL assume true; 1496469#factEXIT >#70#return; 1496466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496462#factFINAL assume true; 1496452#factEXIT >#70#return; 1496451#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1496224#factFINAL assume true; 1496196#factEXIT >#70#return; 1496220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497087#factFINAL assume true; 1497083#factEXIT >#70#return; 1497084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497283#factFINAL assume true; 1497278#factEXIT >#70#return; 1497276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497250#factFINAL assume true; 1497245#factEXIT >#70#return; 1497246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1497446#factFINAL assume true; 1497443#factEXIT >#70#return; 1497440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1498299#factFINAL assume true; 1497590#factEXIT >#74#return; 1497103#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1497133#$Ultimate##0 ~n := #in~n; 1497089#L25 assume ~n <= 0;#res := 1; 1496541#factFINAL assume true; 1497552#factEXIT >#76#return; 1497551#L30-3 [2023-11-29 01:19:57,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1160857592, now seen corresponding path program 20 times [2023-11-29 01:19:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:19:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110554292] [2023-11-29 01:19:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:19:57,862 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:19:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359950895] [2023-11-29 01:19:57,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:19:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:19:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:19:57,864 INFO L229 MonitoredProcess]: Starting monitored process 577 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:19:57,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (577)] Waiting until timeout for monitored process [2023-11-29 01:19:59,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:19:59,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:19:59,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:19:59,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20398 backedges. 8461 proven. 141 refuted. 0 times theorem prover too weak. 11796 trivial. 0 not checked. [2023-11-29 01:20:00,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20398 backedges. 717 proven. 342 refuted. 0 times theorem prover too weak. 19339 trivial. 0 not checked. [2023-11-29 01:20:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110554292] [2023-11-29 01:20:00,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359950895] [2023-11-29 01:20:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359950895] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:00,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-11-29 01:20:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333634688] [2023-11-29 01:20:00,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:00,492 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:20:00,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1800238908, now seen corresponding path program 14 times [2023-11-29 01:20:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135893614] [2023-11-29 01:20:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:00,532 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809154414] [2023-11-29 01:20:00,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:20:00,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:00,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:00,534 INFO L229 MonitoredProcess]: Starting monitored process 578 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:00,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (578)] Waiting until timeout for monitored process [2023-11-29 01:20:02,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:20:02,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:02,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:20:02,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25873 backedges. 7387 proven. 89 refuted. 0 times theorem prover too weak. 18397 trivial. 0 not checked. [2023-11-29 01:20:02,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 25873 backedges. 175 proven. 1489 refuted. 0 times theorem prover too weak. 24209 trivial. 0 not checked. [2023-11-29 01:20:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135893614] [2023-11-29 01:20:03,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809154414] [2023-11-29 01:20:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809154414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:03,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:03,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2023-11-29 01:20:03,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569179621] [2023-11-29 01:20:03,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:03,573 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:20:03,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:20:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:20:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:20:03,573 INFO L87 Difference]: Start difference. First operand 13530 states and 37826 transitions. cyclomatic complexity: 24383 Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 8 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 7 states have call predecessors, (27), 8 states have call successors, (27) [2023-11-29 01:20:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:03,915 INFO L93 Difference]: Finished difference Result 13450 states and 37357 transitions. [2023-11-29 01:20:03,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13450 states and 37357 transitions. [2023-11-29 01:20:04,049 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1511 [2023-11-29 01:20:04,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13450 states to 13441 states and 37346 transitions. [2023-11-29 01:20:04,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2515 [2023-11-29 01:20:04,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2515 [2023-11-29 01:20:04,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13441 states and 37346 transitions. [2023-11-29 01:20:04,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:20:04,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13441 states and 37346 transitions. [2023-11-29 01:20:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13441 states and 37346 transitions. [2023-11-29 01:20:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13441 to 13419. [2023-11-29 01:20:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13419 states, 7877 states have (on average 1.0229782912276246) internal successors, (8058), 7823 states have internal predecessors, (8058), 3845 states have call successors, (4326), 1775 states have call predecessors, (4326), 1697 states have return successors, (24694), 3820 states have call predecessors, (24694), 3845 states have call successors, (24694) [2023-11-29 01:20:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13419 states to 13419 states and 37078 transitions. [2023-11-29 01:20:04,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13419 states and 37078 transitions. [2023-11-29 01:20:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:20:04,792 INFO L428 stractBuchiCegarLoop]: Abstraction has 13419 states and 37078 transitions. [2023-11-29 01:20:04,793 INFO L335 stractBuchiCegarLoop]: ======== Iteration 59 ============ [2023-11-29 01:20:04,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13419 states and 37078 transitions. [2023-11-29 01:20:04,853 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1511 [2023-11-29 01:20:04,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:20:04,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:20:04,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [91, 91, 52, 52, 52, 52, 39, 13, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:04,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [79, 79, 64, 64, 64, 64, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:04,859 INFO L748 eck$LassoCheckResult]: Stem: 1524079#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1524033#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1524034#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1524052#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1524080#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1524484#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1524481#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1524453#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1524454#$Ultimate##0 ~n := #in~n; 1524462#L25 assume ~n <= 0;#res := 1; 1524461#factFINAL assume true; 1524452#factEXIT >#72#return; 1524446#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1524447#$Ultimate##0 ~n := #in~n; 1524458#L25 assume ~n <= 0;#res := 1; 1524451#factFINAL assume true; 1524445#factEXIT >#74#return; 1524440#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1524441#$Ultimate##0 ~n := #in~n; 1524450#L25 assume ~n <= 0;#res := 1; 1524443#factFINAL assume true; 1524439#factEXIT >#76#return; 1524436#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1524428#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1524424#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1524422#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1524420#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1524418#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1524419#$Ultimate##0 ~n := #in~n; 1524433#L25 assume !(~n <= 0); 1524426#L26 call #t~ret0 := fact(~n - 1);< 1524427#$Ultimate##0 ~n := #in~n; 1524438#L25 assume ~n <= 0;#res := 1; 1524435#factFINAL assume true; 1524425#factEXIT >#70#return; 1524423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524421#factFINAL assume true; 1524417#factEXIT >#78#return; 1524415#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1524416#$Ultimate##0 ~n := #in~n; 1524432#L25 assume ~n <= 0;#res := 1; 1524431#factFINAL assume true; 1524414#factEXIT >#80#return; 1524411#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1524412#$Ultimate##0 ~n := #in~n; 1524670#L25 assume !(~n <= 0); 1524668#L26 call #t~ret0 := fact(~n - 1);< 1524669#$Ultimate##0 ~n := #in~n; 1525228#L25 assume ~n <= 0;#res := 1; 1525229#factFINAL assume true; 1524666#factEXIT >#70#return; 1524639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524511#factFINAL assume true; 1524410#factEXIT >#82#return; 1524409#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1524408#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1524406#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1524405#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1524402#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1524308#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1524311#$Ultimate##0 ~n := #in~n; 1524330#L25 assume !(~n <= 0); 1524319#L26 call #t~ret0 := fact(~n - 1);< 1524325#$Ultimate##0 ~n := #in~n; 1524340#L25 assume !(~n <= 0); 1524320#L26 call #t~ret0 := fact(~n - 1);< 1524335#$Ultimate##0 ~n := #in~n; 1524341#L25 assume ~n <= 0;#res := 1; 1524339#factFINAL assume true; 1524334#factEXIT >#70#return; 1524332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524327#factFINAL assume true; 1524318#factEXIT >#70#return; 1524316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524314#factFINAL assume true; 1524305#factEXIT >#78#return; 1524310#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1524400#$Ultimate##0 ~n := #in~n; 1524407#L25 assume ~n <= 0;#res := 1; 1524403#factFINAL assume true; 1524399#factEXIT >#80#return; 1524396#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1524398#$Ultimate##0 ~n := #in~n; 1524444#L25 assume !(~n <= 0); 1524375#L26 call #t~ret0 := fact(~n - 1);< 1524391#$Ultimate##0 ~n := #in~n; 1524543#L25 assume !(~n <= 0); 1524377#L26 call #t~ret0 := fact(~n - 1);< 1524536#$Ultimate##0 ~n := #in~n; 1524579#L25 assume ~n <= 0;#res := 1; 1524554#factFINAL assume true; 1524535#factEXIT >#70#return; 1524534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524533#factFINAL assume true; 1524489#factEXIT >#70#return; 1524490#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524539#factFINAL assume true; 1524395#factEXIT >#82#return; 1524394#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1524392#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1524387#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1524384#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1524382#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1524349#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1524352#$Ultimate##0 ~n := #in~n; 1524393#L25 assume !(~n <= 0); 1524374#L26 call #t~ret0 := fact(~n - 1);< 1524391#$Ultimate##0 ~n := #in~n; 1524543#L25 assume !(~n <= 0); 1524377#L26 call #t~ret0 := fact(~n - 1);< 1524536#$Ultimate##0 ~n := #in~n; 1524543#L25 assume !(~n <= 0); 1524377#L26 call #t~ret0 := fact(~n - 1);< 1524536#$Ultimate##0 ~n := #in~n; 1524579#L25 assume ~n <= 0;#res := 1; 1524554#factFINAL assume true; 1524535#factEXIT >#70#return; 1524534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524533#factFINAL assume true; 1524489#factEXIT >#70#return; 1524488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524430#factFINAL assume true; 1524389#factEXIT >#70#return; 1524386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524354#factFINAL assume true; 1524347#factEXIT >#78#return; 1524351#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1524370#$Ultimate##0 ~n := #in~n; 1524581#L25 assume ~n <= 0;#res := 1; 1524580#factFINAL assume true; 1524577#factEXIT >#80#return; 1524573#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1524574#$Ultimate##0 ~n := #in~n; 1524578#L25 assume !(~n <= 0); 1524558#L26 call #t~ret0 := fact(~n - 1);< 1524576#$Ultimate##0 ~n := #in~n; 1524610#L25 assume !(~n <= 0); 1524560#L26 call #t~ret0 := fact(~n - 1);< 1524563#$Ultimate##0 ~n := #in~n; 1524609#L25 assume !(~n <= 0); 1524557#L26 call #t~ret0 := fact(~n - 1);< 1524606#$Ultimate##0 ~n := #in~n; 1524608#L25 assume ~n <= 0;#res := 1; 1524607#factFINAL assume true; 1524605#factEXIT >#70#return; 1524604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524603#factFINAL assume true; 1524602#factEXIT >#70#return; 1524601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524600#factFINAL assume true; 1524555#factEXIT >#70#return; 1524562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524583#factFINAL assume true; 1524572#factEXIT >#82#return; 1524571#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1524570#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1524569#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1524567#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1524565#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1524530#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1524532#$Ultimate##0 ~n := #in~n; 1524568#L25 assume !(~n <= 0); 1524559#L26 call #t~ret0 := fact(~n - 1);< 1524563#$Ultimate##0 ~n := #in~n; 1524609#L25 assume !(~n <= 0); 1524557#L26 call #t~ret0 := fact(~n - 1);< 1524606#$Ultimate##0 ~n := #in~n; 1524609#L25 assume !(~n <= 0); 1524557#L26 call #t~ret0 := fact(~n - 1);< 1524606#$Ultimate##0 ~n := #in~n; 1524609#L25 assume !(~n <= 0); 1524557#L26 call #t~ret0 := fact(~n - 1);< 1524606#$Ultimate##0 ~n := #in~n; 1524608#L25 assume ~n <= 0;#res := 1; 1524607#factFINAL assume true; 1524605#factEXIT >#70#return; 1524604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524603#factFINAL assume true; 1524602#factEXIT >#70#return; 1524601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524600#factFINAL assume true; 1524555#factEXIT >#70#return; 1524561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524575#factFINAL assume true; 1524566#factEXIT >#70#return; 1524564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524553#factFINAL assume true; 1524529#factEXIT >#78#return; 1524493#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1524495#$Ultimate##0 ~n := #in~n; 1526659#L25 assume ~n <= 0;#res := 1; 1526658#factFINAL assume true; 1526657#factEXIT >#80#return; 1526620#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1526655#$Ultimate##0 ~n := #in~n; 1526654#L25 assume !(~n <= 0); 1525251#L26 call #t~ret0 := fact(~n - 1);< 1526607#$Ultimate##0 ~n := #in~n; 1526641#L25 assume !(~n <= 0); 1525258#L26 call #t~ret0 := fact(~n - 1);< 1526638#$Ultimate##0 ~n := #in~n; 1526637#L25 assume !(~n <= 0); 1525254#L26 call #t~ret0 := fact(~n - 1);< 1525332#$Ultimate##0 ~n := #in~n; 1526662#L25 assume !(~n <= 0); 1525241#L26 call #t~ret0 := fact(~n - 1);< 1526636#$Ultimate##0 ~n := #in~n; 1526665#L25 assume ~n <= 0;#res := 1; 1526663#factFINAL assume true; 1526635#factEXIT >#70#return; 1526634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1526633#factFINAL assume true; 1526631#factEXIT >#70#return; 1526630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1526628#factFINAL assume true; 1526622#factEXIT >#70#return; 1526621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1526619#factFINAL assume true; 1526611#factEXIT >#70#return; 1526613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529596#factFINAL assume true; 1529593#factEXIT >#82#return; 1525636#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1529585#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1529582#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1529579#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1524087#L42-4 havoc main_~k~0#1; 1529575#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1529574#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1529573#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1529507#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529356#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1529452#$Ultimate##0 ~n := #in~n; 1529465#L25 assume !(~n <= 0); 1529459#L26 call #t~ret0 := fact(~n - 1);< 1529460#$Ultimate##0 ~n := #in~n; 1529488#L25 assume ~n <= 0;#res := 1; 1529487#factFINAL assume true; 1529458#factEXIT >#70#return; 1529457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529456#factFINAL assume true; 1529446#factEXIT >#72#return; 1529341#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1529403#$Ultimate##0 ~n := #in~n; 1529445#L25 assume ~n <= 0;#res := 1; 1529440#factFINAL assume true; 1529332#factEXIT >#74#return; 1528767#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1529330#$Ultimate##0 ~n := #in~n; 1529436#L25 assume !(~n <= 0); 1524025#L26 call #t~ret0 := fact(~n - 1);< 1529434#$Ultimate##0 ~n := #in~n; 1529441#L25 assume ~n <= 0;#res := 1; 1529439#factFINAL assume true; 1529433#factEXIT >#70#return; 1529431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529430#factFINAL assume true; 1529329#factEXIT >#76#return; 1528773#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1529327#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1529326#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1529325#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1529324#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529020#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1529187#$Ultimate##0 ~n := #in~n; 1529331#L25 assume !(~n <= 0); 1528971#L26 call #t~ret0 := fact(~n - 1);< 1529328#$Ultimate##0 ~n := #in~n; 1528998#L25 assume ~n <= 0;#res := 1; 1528984#factFINAL assume true; 1528969#factEXIT >#70#return; 1528977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529322#factFINAL assume true; 1529249#factEXIT >#72#return; 1528651#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1528751#$Ultimate##0 ~n := #in~n; 1528752#L25 assume !(~n <= 0); 1528748#L26 call #t~ret0 := fact(~n - 1);< 1528749#$Ultimate##0 ~n := #in~n; 1528998#L25 assume ~n <= 0;#res := 1; 1528984#factFINAL assume true; 1528969#factEXIT >#70#return; 1528951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1528945#factFINAL assume true; 1528641#factEXIT >#74#return; 1528617#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1528907#$Ultimate##0 ~n := #in~n; 1528884#L25 assume ~n <= 0;#res := 1; 1528885#factFINAL assume true; 1528604#factEXIT >#76#return; 1528622#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1530470#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1530469#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1530467#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1530466#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1528895#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1528929#$Ultimate##0 ~n := #in~n; 1528924#L25 assume !(~n <= 0); 1528731#L26 call #t~ret0 := fact(~n - 1);< 1528872#$Ultimate##0 ~n := #in~n; 1529561#L25 assume !(~n <= 0); 1528742#L26 call #t~ret0 := fact(~n - 1);< 1529525#$Ultimate##0 ~n := #in~n; 1528908#L25 assume ~n <= 0;#res := 1; 1528905#factFINAL assume true; 1528878#factEXIT >#70#return; 1528880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1528862#factFINAL assume true; 1528864#factEXIT >#70#return; 1528876#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529750#factFINAL assume true; 1529740#factEXIT >#78#return; 1529744#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1530451#$Ultimate##0 ~n := #in~n; 1530473#L25 assume !(~n <= 0); 1530269#L26 call #t~ret0 := fact(~n - 1);< 1530298#$Ultimate##0 ~n := #in~n; 1530336#L25 assume ~n <= 0;#res := 1; 1530278#factFINAL assume true; 1530266#factEXIT >#70#return; 1530272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530453#factFINAL assume true; 1530450#factEXIT >#80#return; 1530428#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530433#$Ultimate##0 ~n := #in~n; 1530436#L25 assume !(~n <= 0); 1530267#L26 call #t~ret0 := fact(~n - 1);< 1530298#$Ultimate##0 ~n := #in~n; 1530336#L25 assume ~n <= 0;#res := 1; 1530278#factFINAL assume true; 1530266#factEXIT >#70#return; 1530273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530434#factFINAL assume true; 1530423#factEXIT >#82#return; 1530432#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1531508#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1531507#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1531506#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1531505#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1530038#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1530165#$Ultimate##0 ~n := #in~n; 1530858#L25 assume !(~n <= 0); 1530228#L26 call #t~ret0 := fact(~n - 1);< 1530743#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530164#factFINAL assume true; 1529805#factEXIT >#78#return; 1530145#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1530337#$Ultimate##0 ~n := #in~n; 1530327#L25 assume !(~n <= 0); 1530270#L26 call #t~ret0 := fact(~n - 1);< 1530276#$Ultimate##0 ~n := #in~n; 1530336#L25 assume ~n <= 0;#res := 1; 1530278#factFINAL assume true; 1530266#factEXIT >#70#return; 1530241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530212#factFINAL assume true; 1530166#factEXIT >#80#return; 1529901#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530163#$Ultimate##0 ~n := #in~n; 1530878#L25 assume !(~n <= 0); 1530221#L26 call #t~ret0 := fact(~n - 1);< 1530240#$Ultimate##0 ~n := #in~n; 1530339#L25 assume !(~n <= 0); 1530329#L26 call #t~ret0 := fact(~n - 1);< 1530334#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531197#factFINAL assume true; 1531160#factEXIT >#82#return; 1530113#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1531502#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1531501#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1531500#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1531499#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529930#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1530165#$Ultimate##0 ~n := #in~n; 1530858#L25 assume !(~n <= 0); 1530228#L26 call #t~ret0 := fact(~n - 1);< 1530743#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530164#factFINAL assume true; 1529805#factEXIT >#78#return; 1530121#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1530337#$Ultimate##0 ~n := #in~n; 1530327#L25 assume !(~n <= 0); 1530270#L26 call #t~ret0 := fact(~n - 1);< 1530276#$Ultimate##0 ~n := #in~n; 1530336#L25 assume ~n <= 0;#res := 1; 1530278#factFINAL assume true; 1530266#factEXIT >#70#return; 1530241#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530212#factFINAL assume true; 1530166#factEXIT >#80#return; 1530012#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530163#$Ultimate##0 ~n := #in~n; 1530878#L25 assume !(~n <= 0); 1530221#L26 call #t~ret0 := fact(~n - 1);< 1530240#$Ultimate##0 ~n := #in~n; 1530339#L25 assume !(~n <= 0); 1530329#L26 call #t~ret0 := fact(~n - 1);< 1530334#$Ultimate##0 ~n := #in~n; 1530435#L25 assume !(~n <= 0); 1530347#L26 call #t~ret0 := fact(~n - 1);< 1530349#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530164#factFINAL assume true; 1529805#factEXIT >#82#return; 1530137#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1531494#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1531493#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1531492#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1529682#L42-4 havoc main_~k~0#1; 1529639#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1529636#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1529632#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1529629#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529447#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1529466#$Ultimate##0 ~n := #in~n; 1529464#L25 assume !(~n <= 0); 1529459#L26 call #t~ret0 := fact(~n - 1);< 1529460#$Ultimate##0 ~n := #in~n; 1529492#L25 assume !(~n <= 0); 1529634#L26 call #t~ret0 := fact(~n - 1);< 1529638#$Ultimate##0 ~n := #in~n; 1529680#L25 assume ~n <= 0;#res := 1; 1529679#factFINAL assume true; 1529678#factEXIT >#70#return; 1529677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529637#factFINAL assume true; 1529633#factEXIT >#70#return; 1529631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529630#factFINAL assume true; 1529628#factEXIT >#72#return; 1529366#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1529403#$Ultimate##0 ~n := #in~n; 1529445#L25 assume ~n <= 0;#res := 1; 1529440#factFINAL assume true; 1529332#factEXIT >#74#return; 1528769#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1529626#$Ultimate##0 ~n := #in~n; 1537105#L25 assume !(~n <= 0); 1524026#L26 call #t~ret0 := fact(~n - 1);< 1537103#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1524068#L25 assume ~n <= 0;#res := 1; 1524069#factFINAL assume true; 1524011#factEXIT >#70#return; 1524013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537225#factFINAL assume true; 1537217#factEXIT >#70#return; 1537215#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537214#factFINAL assume true; 1528763#factEXIT >#76#return; 1528774#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1529619#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1529613#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1529609#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1529607#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529062#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1529187#$Ultimate##0 ~n := #in~n; 1529331#L25 assume !(~n <= 0); 1528971#L26 call #t~ret0 := fact(~n - 1);< 1529328#$Ultimate##0 ~n := #in~n; 1529624#L25 assume !(~n <= 0); 1529304#L26 call #t~ret0 := fact(~n - 1);< 1529617#$Ultimate##0 ~n := #in~n; 1529625#L25 assume ~n <= 0;#res := 1; 1529620#factFINAL assume true; 1529614#factEXIT >#70#return; 1529610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529608#factFINAL assume true; 1529296#factEXIT >#70#return; 1529306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529705#factFINAL assume true; 1529016#factEXIT >#72#return; 1528642#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1528751#$Ultimate##0 ~n := #in~n; 1528752#L25 assume !(~n <= 0); 1528748#L26 call #t~ret0 := fact(~n - 1);< 1528749#$Ultimate##0 ~n := #in~n; 1528998#L25 assume ~n <= 0;#res := 1; 1528984#factFINAL assume true; 1528969#factEXIT >#70#return; 1528951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1528945#factFINAL assume true; 1528641#factEXIT >#74#return; 1528613#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1528910#$Ultimate##0 ~n := #in~n; 1529323#L25 assume !(~n <= 0); 1528970#L26 call #t~ret0 := fact(~n - 1);< 1529000#$Ultimate##0 ~n := #in~n; 1528998#L25 assume ~n <= 0;#res := 1; 1528984#factFINAL assume true; 1528969#factEXIT >#70#return; 1528976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529248#factFINAL assume true; 1529238#factEXIT >#76#return; 1529243#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1529604#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1529603#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1529602#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1529597#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529110#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1529187#$Ultimate##0 ~n := #in~n; 1529331#L25 assume !(~n <= 0); 1528971#L26 call #t~ret0 := fact(~n - 1);< 1529328#$Ultimate##0 ~n := #in~n; 1529624#L25 assume !(~n <= 0); 1529304#L26 call #t~ret0 := fact(~n - 1);< 1529617#$Ultimate##0 ~n := #in~n; 1529625#L25 assume ~n <= 0;#res := 1; 1529620#factFINAL assume true; 1529614#factEXIT >#70#return; 1529610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529608#factFINAL assume true; 1529296#factEXIT >#70#return; 1529306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529705#factFINAL assume true; 1529016#factEXIT >#72#return; 1528645#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1528873#$Ultimate##0 ~n := #in~n; 1531702#L25 assume !(~n <= 0); 1531662#L26 call #t~ret0 := fact(~n - 1);< 1531672#$Ultimate##0 ~n := #in~n; 1531676#L25 assume ~n <= 0;#res := 1; 1531674#factFINAL assume true; 1531661#factEXIT >#70#return; 1531637#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531636#factFINAL assume true; 1531632#factEXIT >#74#return; 1530294#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530925#$Ultimate##0 ~n := #in~n; 1530922#L25 assume ~n <= 0;#res := 1; 1530923#factFINAL assume true; 1531630#factEXIT >#76#return; 1531603#L30-3 [2023-11-29 01:20:04,859 INFO L750 eck$LassoCheckResult]: Loop: 1531603#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1531556#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1531553#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1531550#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1531546#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1530011#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1530165#$Ultimate##0 ~n := #in~n; 1530858#L25 assume !(~n <= 0); 1530228#L26 call #t~ret0 := fact(~n - 1);< 1530743#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530164#factFINAL assume true; 1529805#factEXIT >#78#return; 1530136#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1530337#$Ultimate##0 ~n := #in~n; 1530327#L25 assume !(~n <= 0); 1530270#L26 call #t~ret0 := fact(~n - 1);< 1530276#$Ultimate##0 ~n := #in~n; 1530435#L25 assume !(~n <= 0); 1530347#L26 call #t~ret0 := fact(~n - 1);< 1530349#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530330#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531197#factFINAL assume true; 1531160#factEXIT >#80#return; 1530069#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530438#$Ultimate##0 ~n := #in~n; 1530437#L25 assume !(~n <= 0); 1530216#L26 call #t~ret0 := fact(~n - 1);< 1530343#$Ultimate##0 ~n := #in~n; 1530339#L25 assume !(~n <= 0); 1530329#L26 call #t~ret0 := fact(~n - 1);< 1530334#$Ultimate##0 ~n := #in~n; 1530435#L25 assume !(~n <= 0); 1530347#L26 call #t~ret0 := fact(~n - 1);< 1530349#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530164#factFINAL assume true; 1529805#factEXIT >#82#return; 1530159#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1535552#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1535550#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1535549#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1535548#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529875#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1530165#$Ultimate##0 ~n := #in~n; 1530858#L25 assume !(~n <= 0); 1530228#L26 call #t~ret0 := fact(~n - 1);< 1530743#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530236#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530716#factFINAL assume true; 1530709#factEXIT >#70#return; 1530708#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530706#factFINAL assume true; 1530698#factEXIT >#78#return; 1529985#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1530165#$Ultimate##0 ~n := #in~n; 1530858#L25 assume !(~n <= 0); 1530228#L26 call #t~ret0 := fact(~n - 1);< 1530743#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530236#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530716#factFINAL assume true; 1530709#factEXIT >#70#return; 1530712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531375#factFINAL assume true; 1531367#factEXIT >#70#return; 1531364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531338#factFINAL assume true; 1531333#factEXIT >#70#return; 1531337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531383#factFINAL assume true; 1531378#factEXIT >#80#return; 1530022#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530438#$Ultimate##0 ~n := #in~n; 1530437#L25 assume !(~n <= 0); 1530216#L26 call #t~ret0 := fact(~n - 1);< 1530343#$Ultimate##0 ~n := #in~n; 1530339#L25 assume !(~n <= 0); 1530329#L26 call #t~ret0 := fact(~n - 1);< 1530334#$Ultimate##0 ~n := #in~n; 1530435#L25 assume !(~n <= 0); 1530347#L26 call #t~ret0 := fact(~n - 1);< 1530349#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530211#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530164#factFINAL assume true; 1529805#factEXIT >#82#return; 1530140#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1534324#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1534316#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1531538#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1524085#L42-4 havoc main_~k~0#1; 1524051#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1524045#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1524046#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1535474#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1529448#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1529466#$Ultimate##0 ~n := #in~n; 1529464#L25 assume !(~n <= 0); 1529459#L26 call #t~ret0 := fact(~n - 1);< 1529460#$Ultimate##0 ~n := #in~n; 1529492#L25 assume !(~n <= 0); 1529634#L26 call #t~ret0 := fact(~n - 1);< 1529638#$Ultimate##0 ~n := #in~n; 1529492#L25 assume !(~n <= 0); 1529634#L26 call #t~ret0 := fact(~n - 1);< 1529638#$Ultimate##0 ~n := #in~n; 1529492#L25 assume !(~n <= 0); 1529634#L26 call #t~ret0 := fact(~n - 1);< 1529638#$Ultimate##0 ~n := #in~n; 1529492#L25 assume !(~n <= 0); 1529634#L26 call #t~ret0 := fact(~n - 1);< 1529638#$Ultimate##0 ~n := #in~n; 1529492#L25 assume !(~n <= 0); 1529634#L26 call #t~ret0 := fact(~n - 1);< 1529638#$Ultimate##0 ~n := #in~n; 1529680#L25 assume ~n <= 0;#res := 1; 1529679#factFINAL assume true; 1529678#factEXIT >#70#return; 1529677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1529637#factFINAL assume true; 1529633#factEXIT >#70#return; 1529635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537164#factFINAL assume true; 1537161#factEXIT >#70#return; 1537162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537235#factFINAL assume true; 1537133#factEXIT >#70#return; 1537134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537269#factFINAL assume true; 1537266#factEXIT >#70#return; 1537265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537263#factFINAL assume true; 1537259#factEXIT >#70#return; 1537258#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537255#factFINAL assume true; 1537252#factEXIT >#72#return; 1529334#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1529452#$Ultimate##0 ~n := #in~n; 1529465#L25 assume ~n <= 0;#res := 1; 1529440#factFINAL assume true; 1529332#factEXIT >#74#return; 1529374#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1537245#$Ultimate##0 ~n := #in~n; 1537243#L25 assume !(~n <= 0); 1537094#L26 call #t~ret0 := fact(~n - 1);< 1537241#$Ultimate##0 ~n := #in~n; 1537240#L25 assume !(~n <= 0); 1537100#L26 call #t~ret0 := fact(~n - 1);< 1537239#$Ultimate##0 ~n := #in~n; 1537237#L25 assume !(~n <= 0); 1524023#L26 call #t~ret0 := fact(~n - 1);< 1537111#$Ultimate##0 ~n := #in~n; 1537110#L25 assume !(~n <= 0); 1524027#L26 call #t~ret0 := fact(~n - 1);< 1537107#$Ultimate##0 ~n := #in~n; 1537106#L25 assume !(~n <= 0); 1524022#L26 call #t~ret0 := fact(~n - 1);< 1537104#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1529443#L25 assume !(~n <= 0); 1524012#L26 call #t~ret0 := fact(~n - 1);< 1537102#$Ultimate##0 ~n := #in~n; 1524068#L25 assume ~n <= 0;#res := 1; 1524069#factFINAL assume true; 1524011#factEXIT >#70#return; 1524013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537225#factFINAL assume true; 1537217#factEXIT >#70#return; 1537218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537238#factFINAL assume true; 1537236#factEXIT >#70#return; 1524062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1524021#factFINAL assume true; 1524029#factEXIT >#70#return; 1537163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537272#factFINAL assume true; 1537264#factEXIT >#70#return; 1537262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537261#factFINAL assume true; 1537256#factEXIT >#70#return; 1537257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537411#factFINAL assume true; 1537270#factEXIT >#70#return; 1537271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537410#factFINAL assume true; 1537409#factEXIT >#70#return; 1537407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537406#factFINAL assume true; 1537092#factEXIT >#70#return; 1537101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537384#factFINAL assume true; 1537380#factEXIT >#70#return; 1537378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537376#factFINAL assume true; 1537375#factEXIT >#70#return; 1537372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537371#factFINAL assume true; 1537367#factEXIT >#70#return; 1537365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537363#factFINAL assume true; 1537361#factEXIT >#70#return; 1537359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537358#factFINAL assume true; 1537354#factEXIT >#70#return; 1537355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537388#factFINAL assume true; 1537386#factEXIT >#70#return; 1537385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537383#factFINAL assume true; 1537381#factEXIT >#70#return; 1537379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537377#factFINAL assume true; 1537373#factEXIT >#70#return; 1537374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1537408#factFINAL assume true; 1537349#factEXIT >#76#return; 1528770#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1529484#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1532468#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1532466#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1532465#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1531921#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1524020#$Ultimate##0 ~n := #in~n; 1532163#L25 assume !(~n <= 0); 1531663#L26 call #t~ret0 := fact(~n - 1);< 1532161#$Ultimate##0 ~n := #in~n; 1532503#L25 assume !(~n <= 0); 1532141#L26 call #t~ret0 := fact(~n - 1);< 1532489#$Ultimate##0 ~n := #in~n; 1532503#L25 assume !(~n <= 0); 1532141#L26 call #t~ret0 := fact(~n - 1);< 1532489#$Ultimate##0 ~n := #in~n; 1532496#L25 assume ~n <= 0;#res := 1; 1532514#factFINAL assume true; 1532487#factEXIT >#70#return; 1532486#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1532482#factFINAL assume true; 1532469#factEXIT >#70#return; 1532467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1532460#factFINAL assume true; 1532455#factEXIT >#70#return; 1532254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1532453#factFINAL assume true; 1532167#factEXIT >#72#return; 1531986#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1524020#$Ultimate##0 ~n := #in~n; 1532163#L25 assume !(~n <= 0); 1531663#L26 call #t~ret0 := fact(~n - 1);< 1532161#$Ultimate##0 ~n := #in~n; 1531676#L25 assume ~n <= 0;#res := 1; 1531674#factFINAL assume true; 1531661#factEXIT >#70#return; 1531669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1532321#factFINAL assume true; 1531849#factEXIT >#74#return; 1530260#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530748#$Ultimate##0 ~n := #in~n; 1530746#L25 assume !(~n <= 0); 1530231#L26 call #t~ret0 := fact(~n - 1);< 1530240#$Ultimate##0 ~n := #in~n; 1530339#L25 assume !(~n <= 0); 1530329#L26 call #t~ret0 := fact(~n - 1);< 1530334#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530239#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531798#factFINAL assume true; 1531767#factEXIT >#76#return; 1531697#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1531647#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1531646#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1531644#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1531643#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1530593#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1524018#$Ultimate##0 ~n := #in~n; 1530476#L25 assume !(~n <= 0); 1530224#L26 call #t~ret0 := fact(~n - 1);< 1530743#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530236#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530716#factFINAL assume true; 1530709#factEXIT >#70#return; 1530712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531375#factFINAL assume true; 1531367#factEXIT >#70#return; 1531368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531685#factFINAL assume true; 1531681#factEXIT >#72#return; 1530503#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1524018#$Ultimate##0 ~n := #in~n; 1530476#L25 assume !(~n <= 0); 1530224#L26 call #t~ret0 := fact(~n - 1);< 1530743#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530422#L25 assume !(~n <= 0); 1530226#L26 call #t~ret0 := fact(~n - 1);< 1530421#$Ultimate##0 ~n := #in~n; 1530419#L25 assume ~n <= 0;#res := 1; 1530417#factFINAL assume true; 1530346#factEXIT >#70#return; 1530341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530338#factFINAL assume true; 1530328#factEXIT >#70#return; 1530277#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530242#factFINAL assume true; 1530213#factEXIT >#70#return; 1530236#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1530716#factFINAL assume true; 1530709#factEXIT >#70#return; 1530712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531375#factFINAL assume true; 1531367#factEXIT >#70#return; 1531364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531338#factFINAL assume true; 1531333#factEXIT >#70#return; 1531331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531329#factFINAL assume true; 1531324#factEXIT >#70#return; 1531321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531320#factFINAL assume true; 1531317#factEXIT >#70#return; 1531318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1531328#factFINAL assume true; 1531310#factEXIT >#70#return; 1531284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1533262#factFINAL assume true; 1531639#factEXIT >#74#return; 1530382#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1530414#$Ultimate##0 ~n := #in~n; 1530411#L25 assume ~n <= 0;#res := 1; 1530412#factFINAL assume true; 1531608#factEXIT >#76#return; 1531603#L30-3 [2023-11-29 01:20:04,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash 412797880, now seen corresponding path program 21 times [2023-11-29 01:20:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586127459] [2023-11-29 01:20:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:05,000 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:05,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731940588] [2023-11-29 01:20:05,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:20:05,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:05,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:05,003 INFO L229 MonitoredProcess]: Starting monitored process 579 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:05,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (579)] Waiting until timeout for monitored process [2023-11-29 01:20:06,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 01:20:06,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:06,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 01:20:06,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 19456 backedges. 1129 proven. 6 refuted. 0 times theorem prover too weak. 18321 trivial. 0 not checked. [2023-11-29 01:20:06,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 19456 backedges. 769 proven. 13 refuted. 0 times theorem prover too weak. 18674 trivial. 0 not checked. [2023-11-29 01:20:07,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:07,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586127459] [2023-11-29 01:20:07,332 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:07,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731940588] [2023-11-29 01:20:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731940588] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:07,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:07,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2023-11-29 01:20:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116450626] [2023-11-29 01:20:07,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:07,333 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:20:07,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -892643324, now seen corresponding path program 15 times [2023-11-29 01:20:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453060157] [2023-11-29 01:20:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:07,444 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:07,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124939233] [2023-11-29 01:20:07,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:20:07,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:07,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:07,445 INFO L229 MonitoredProcess]: Starting monitored process 580 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:07,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (580)] Waiting until timeout for monitored process [2023-11-29 01:20:09,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 01:20:09,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:09,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 01:20:09,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16411 backedges. 804 proven. 164 refuted. 0 times theorem prover too weak. 15443 trivial. 0 not checked. [2023-11-29 01:20:09,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16411 backedges. 804 proven. 165 refuted. 0 times theorem prover too weak. 15442 trivial. 0 not checked. [2023-11-29 01:20:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453060157] [2023-11-29 01:20:10,082 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124939233] [2023-11-29 01:20:10,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124939233] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:10,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:10,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2023-11-29 01:20:10,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805721614] [2023-11-29 01:20:10,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:10,084 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:20:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:20:10,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:20:10,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:20:10,084 INFO L87 Difference]: Start difference. First operand 13419 states and 37078 transitions. cyclomatic complexity: 23745 Second operand has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (19), 1 states have call predecessors, (19), 4 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-29 01:20:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:10,589 INFO L93 Difference]: Finished difference Result 14964 states and 44248 transitions. [2023-11-29 01:20:10,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14964 states and 44248 transitions. [2023-11-29 01:20:10,821 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2017 [2023-11-29 01:20:11,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14964 states to 14918 states and 43946 transitions. [2023-11-29 01:20:11,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3017 [2023-11-29 01:20:11,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3017 [2023-11-29 01:20:11,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14918 states and 43946 transitions. [2023-11-29 01:20:11,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:20:11,151 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14918 states and 43946 transitions. [2023-11-29 01:20:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14918 states and 43946 transitions. [2023-11-29 01:20:11,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14918 to 13703. [2023-11-29 01:20:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13703 states, 8048 states have (on average 1.0224900596421471) internal successors, (8229), 7984 states have internal predecessors, (8229), 3955 states have call successors, (4401), 1785 states have call predecessors, (4401), 1700 states have return successors, (25349), 3933 states have call predecessors, (25349), 3955 states have call successors, (25349) [2023-11-29 01:20:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13703 states to 13703 states and 37979 transitions. [2023-11-29 01:20:11,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13703 states and 37979 transitions. [2023-11-29 01:20:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:20:11,925 INFO L428 stractBuchiCegarLoop]: Abstraction has 13703 states and 37979 transitions. [2023-11-29 01:20:11,925 INFO L335 stractBuchiCegarLoop]: ======== Iteration 60 ============ [2023-11-29 01:20:11,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13703 states and 37979 transitions. [2023-11-29 01:20:11,989 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1595 [2023-11-29 01:20:11,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:20:11,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:20:11,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [105, 105, 66, 66, 66, 66, 39, 13, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:11,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [91, 91, 76, 76, 76, 76, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:11,994 INFO L748 eck$LassoCheckResult]: Stem: 1558960#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1558907#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1558908#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1558928#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1558961#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1559365#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1559362#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1559334#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1559335#$Ultimate##0 ~n := #in~n; 1559343#L25 assume ~n <= 0;#res := 1; 1559342#factFINAL assume true; 1559333#factEXIT >#72#return; 1559327#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1559328#$Ultimate##0 ~n := #in~n; 1559339#L25 assume ~n <= 0;#res := 1; 1559332#factFINAL assume true; 1559326#factEXIT >#74#return; 1559321#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1559322#$Ultimate##0 ~n := #in~n; 1559331#L25 assume ~n <= 0;#res := 1; 1559324#factFINAL assume true; 1559320#factEXIT >#76#return; 1559317#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1559309#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1559305#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1559303#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1559301#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1559299#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1559300#$Ultimate##0 ~n := #in~n; 1559314#L25 assume !(~n <= 0); 1559307#L26 call #t~ret0 := fact(~n - 1);< 1559308#$Ultimate##0 ~n := #in~n; 1559319#L25 assume ~n <= 0;#res := 1; 1559316#factFINAL assume true; 1559306#factEXIT >#70#return; 1559304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559302#factFINAL assume true; 1559298#factEXIT >#78#return; 1559296#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1559297#$Ultimate##0 ~n := #in~n; 1559313#L25 assume ~n <= 0;#res := 1; 1559312#factFINAL assume true; 1559295#factEXIT >#80#return; 1559292#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1559293#$Ultimate##0 ~n := #in~n; 1559485#L25 assume !(~n <= 0); 1559482#L26 call #t~ret0 := fact(~n - 1);< 1559484#$Ultimate##0 ~n := #in~n; 1560110#L25 assume ~n <= 0;#res := 1; 1560097#factFINAL assume true; 1559481#factEXIT >#70#return; 1559473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559461#factFINAL assume true; 1559291#factEXIT >#82#return; 1559290#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1559289#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1559287#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1559286#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1559283#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1559188#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1559192#$Ultimate##0 ~n := #in~n; 1559211#L25 assume !(~n <= 0); 1559203#L26 call #t~ret0 := fact(~n - 1);< 1559206#$Ultimate##0 ~n := #in~n; 1559221#L25 assume !(~n <= 0); 1559200#L26 call #t~ret0 := fact(~n - 1);< 1559216#$Ultimate##0 ~n := #in~n; 1559222#L25 assume ~n <= 0;#res := 1; 1559220#factFINAL assume true; 1559215#factEXIT >#70#return; 1559213#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559208#factFINAL assume true; 1559199#factEXIT >#70#return; 1559197#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559195#factFINAL assume true; 1559186#factEXIT >#78#return; 1559191#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1559282#$Ultimate##0 ~n := #in~n; 1559288#L25 assume ~n <= 0;#res := 1; 1559284#factFINAL assume true; 1559280#factEXIT >#80#return; 1559278#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1559279#$Ultimate##0 ~n := #in~n; 1559325#L25 assume !(~n <= 0); 1559255#L26 call #t~ret0 := fact(~n - 1);< 1559272#$Ultimate##0 ~n := #in~n; 1559454#L25 assume !(~n <= 0); 1559257#L26 call #t~ret0 := fact(~n - 1);< 1559451#$Ultimate##0 ~n := #in~n; 1559459#L25 assume ~n <= 0;#res := 1; 1559455#factFINAL assume true; 1559450#factEXIT >#70#return; 1559448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559446#factFINAL assume true; 1559370#factEXIT >#70#return; 1559371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559456#factFINAL assume true; 1559276#factEXIT >#82#return; 1559275#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1559273#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1559268#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1559265#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1559263#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1559229#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1559233#$Ultimate##0 ~n := #in~n; 1559274#L25 assume !(~n <= 0); 1559259#L26 call #t~ret0 := fact(~n - 1);< 1559272#$Ultimate##0 ~n := #in~n; 1559454#L25 assume !(~n <= 0); 1559257#L26 call #t~ret0 := fact(~n - 1);< 1559451#$Ultimate##0 ~n := #in~n; 1559454#L25 assume !(~n <= 0); 1559257#L26 call #t~ret0 := fact(~n - 1);< 1559451#$Ultimate##0 ~n := #in~n; 1559459#L25 assume ~n <= 0;#res := 1; 1559455#factFINAL assume true; 1559450#factEXIT >#70#return; 1559448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559446#factFINAL assume true; 1559370#factEXIT >#70#return; 1559369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559311#factFINAL assume true; 1559270#factEXIT >#70#return; 1559267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559235#factFINAL assume true; 1559228#factEXIT >#78#return; 1559232#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1559251#$Ultimate##0 ~n := #in~n; 1559411#L25 assume ~n <= 0;#res := 1; 1559409#factFINAL assume true; 1559408#factEXIT >#80#return; 1559406#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1559407#$Ultimate##0 ~n := #in~n; 1559422#L25 assume !(~n <= 0); 1559415#L26 call #t~ret0 := fact(~n - 1);< 1559421#$Ultimate##0 ~n := #in~n; 1559458#L25 assume !(~n <= 0); 1559417#L26 call #t~ret0 := fact(~n - 1);< 1559427#$Ultimate##0 ~n := #in~n; 1559442#L25 assume !(~n <= 0); 1559414#L26 call #t~ret0 := fact(~n - 1);< 1559438#$Ultimate##0 ~n := #in~n; 1559441#L25 assume ~n <= 0;#res := 1; 1559439#factFINAL assume true; 1559437#factEXIT >#70#return; 1559436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559435#factFINAL assume true; 1559434#factEXIT >#70#return; 1559433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559431#factFINAL assume true; 1559413#factEXIT >#70#return; 1559412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559410#factFINAL assume true; 1559405#factEXIT >#82#return; 1559404#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1559402#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1559400#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1559399#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1559397#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1559384#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1559385#$Ultimate##0 ~n := #in~n; 1559428#L25 assume !(~n <= 0); 1559416#L26 call #t~ret0 := fact(~n - 1);< 1559427#$Ultimate##0 ~n := #in~n; 1559442#L25 assume !(~n <= 0); 1559414#L26 call #t~ret0 := fact(~n - 1);< 1559438#$Ultimate##0 ~n := #in~n; 1559442#L25 assume !(~n <= 0); 1559414#L26 call #t~ret0 := fact(~n - 1);< 1559438#$Ultimate##0 ~n := #in~n; 1559442#L25 assume !(~n <= 0); 1559414#L26 call #t~ret0 := fact(~n - 1);< 1559438#$Ultimate##0 ~n := #in~n; 1559441#L25 assume ~n <= 0;#res := 1; 1559439#factFINAL assume true; 1559437#factEXIT >#70#return; 1559436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559435#factFINAL assume true; 1559434#factEXIT >#70#return; 1559433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559431#factFINAL assume true; 1559413#factEXIT >#70#return; 1559419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559430#factFINAL assume true; 1559426#factEXIT >#70#return; 1559425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1559393#factFINAL assume true; 1559382#factEXIT >#78#return; 1559374#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1559376#$Ultimate##0 ~n := #in~n; 1561171#L25 assume ~n <= 0;#res := 1; 1561163#factFINAL assume true; 1561162#factEXIT >#80#return; 1561143#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1561159#$Ultimate##0 ~n := #in~n; 1561156#L25 assume !(~n <= 0); 1560134#L26 call #t~ret0 := fact(~n - 1);< 1561134#$Ultimate##0 ~n := #in~n; 1561180#L25 assume !(~n <= 0); 1560139#L26 call #t~ret0 := fact(~n - 1);< 1561178#$Ultimate##0 ~n := #in~n; 1561177#L25 assume !(~n <= 0); 1560128#L26 call #t~ret0 := fact(~n - 1);< 1560218#$Ultimate##0 ~n := #in~n; 1561168#L25 assume !(~n <= 0); 1560122#L26 call #t~ret0 := fact(~n - 1);< 1561167#$Ultimate##0 ~n := #in~n; 1561170#L25 assume ~n <= 0;#res := 1; 1561169#factFINAL assume true; 1561166#factEXIT >#70#return; 1561165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1561164#factFINAL assume true; 1561158#factEXIT >#70#return; 1561151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1561147#factFINAL assume true; 1561145#factEXIT >#70#return; 1561144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1561142#factFINAL assume true; 1561137#factEXIT >#70#return; 1561138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564030#factFINAL assume true; 1564021#factEXIT >#82#return; 1560371#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1564016#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1564013#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1564011#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1558971#L42-4 havoc main_~k~0#1; 1564008#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1564007#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1564006#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1564004#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1563960#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564002#$Ultimate##0 ~n := #in~n; 1564041#L25 assume !(~n <= 0); 1564037#L26 call #t~ret0 := fact(~n - 1);< 1564038#$Ultimate##0 ~n := #in~n; 1564042#L25 assume ~n <= 0;#res := 1; 1564039#factFINAL assume true; 1564036#factEXIT >#70#return; 1564035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564034#factFINAL assume true; 1563996#factEXIT >#72#return; 1563940#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1563994#$Ultimate##0 ~n := #in~n; 1564010#L25 assume ~n <= 0;#res := 1; 1564009#factFINAL assume true; 1563921#factEXIT >#74#return; 1563917#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1563918#$Ultimate##0 ~n := #in~n; 1564018#L25 assume !(~n <= 0); 1558847#L26 call #t~ret0 := fact(~n - 1);< 1564015#$Ultimate##0 ~n := #in~n; 1564019#L25 assume ~n <= 0;#res := 1; 1564017#factFINAL assume true; 1564014#factEXIT >#70#return; 1564012#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1563920#factFINAL assume true; 1563916#factEXIT >#76#return; 1563912#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1563909#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1563908#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1563906#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1563902#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1563680#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1563858#$Ultimate##0 ~n := #in~n; 1563886#L25 assume !(~n <= 0); 1563873#L26 call #t~ret0 := fact(~n - 1);< 1563881#$Ultimate##0 ~n := #in~n; 1563905#L25 assume ~n <= 0;#res := 1; 1564192#factFINAL assume true; 1564155#factEXIT >#70#return; 1564159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565623#factFINAL assume true; 1565572#factEXIT >#72#return; 1563910#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1563919#$Ultimate##0 ~n := #in~n; 1563913#L25 assume !(~n <= 0); 1563864#L26 call #t~ret0 := fact(~n - 1);< 1563904#$Ultimate##0 ~n := #in~n; 1563905#L25 assume ~n <= 0;#res := 1; 1564192#factFINAL assume true; 1564155#factEXIT >#70#return; 1564157#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564098#factFINAL assume true; 1564099#factEXIT >#74#return; 1564063#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1564187#$Ultimate##0 ~n := #in~n; 1564729#L25 assume ~n <= 0;#res := 1; 1564730#factFINAL assume true; 1564812#factEXIT >#76#return; 1564813#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1565570#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1565569#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1565568#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1565566#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1564257#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564290#$Ultimate##0 ~n := #in~n; 1564287#L25 assume !(~n <= 0); 1564178#L26 call #t~ret0 := fact(~n - 1);< 1564184#$Ultimate##0 ~n := #in~n; 1565404#L25 assume !(~n <= 0); 1564176#L26 call #t~ret0 := fact(~n - 1);< 1565402#$Ultimate##0 ~n := #in~n; 1564208#L25 assume ~n <= 0;#res := 1; 1564207#factFINAL assume true; 1564202#factEXIT >#70#return; 1564201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564197#factFINAL assume true; 1564161#factEXIT >#70#return; 1564179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565557#factFINAL assume true; 1565554#factEXIT >#78#return; 1565546#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1565553#$Ultimate##0 ~n := #in~n; 1565624#L25 assume !(~n <= 0); 1564791#L26 call #t~ret0 := fact(~n - 1);< 1565207#$Ultimate##0 ~n := #in~n; 1565297#L25 assume ~n <= 0;#res := 1; 1565175#factFINAL assume true; 1564789#factEXIT >#70#return; 1564798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565563#factFINAL assume true; 1565545#factEXIT >#80#return; 1565533#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1565540#$Ultimate##0 ~n := #in~n; 1565629#L25 assume !(~n <= 0); 1564792#L26 call #t~ret0 := fact(~n - 1);< 1565207#$Ultimate##0 ~n := #in~n; 1565297#L25 assume ~n <= 0;#res := 1; 1565175#factFINAL assume true; 1564789#factEXIT >#70#return; 1564795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565628#factFINAL assume true; 1565530#factEXIT >#82#return; 1565539#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1566558#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1566556#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1566554#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1566552#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1564405#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564682#$Ultimate##0 ~n := #in~n; 1566017#L25 assume !(~n <= 0); 1564763#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564681#factFINAL assume true; 1564308#factEXIT >#78#return; 1564620#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1564802#$Ultimate##0 ~n := #in~n; 1564801#L25 assume !(~n <= 0); 1564790#L26 call #t~ret0 := fact(~n - 1);< 1564800#$Ultimate##0 ~n := #in~n; 1565297#L25 assume ~n <= 0;#res := 1; 1565175#factFINAL assume true; 1564789#factEXIT >#70#return; 1564788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564787#factFINAL assume true; 1564683#factEXIT >#80#return; 1564345#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1564666#$Ultimate##0 ~n := #in~n; 1565905#L25 assume !(~n <= 0); 1564762#L26 call #t~ret0 := fact(~n - 1);< 1564779#$Ultimate##0 ~n := #in~n; 1565484#L25 assume !(~n <= 0); 1565418#L26 call #t~ret0 := fact(~n - 1);< 1565423#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1567709#factFINAL assume true; 1566100#factEXIT >#82#return; 1564606#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1566544#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1566543#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1566542#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1566541#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1564429#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564682#$Ultimate##0 ~n := #in~n; 1566017#L25 assume !(~n <= 0); 1564763#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565931#factFINAL assume true; 1565922#factEXIT >#70#return; 1565921#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565918#factFINAL assume true; 1565906#factEXIT >#78#return; 1564408#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1564682#$Ultimate##0 ~n := #in~n; 1566017#L25 assume !(~n <= 0); 1564763#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565297#L25 assume ~n <= 0;#res := 1; 1565175#factFINAL assume true; 1564789#factEXIT >#70#return; 1564788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564787#factFINAL assume true; 1564683#factEXIT >#80#return; 1564545#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1564666#$Ultimate##0 ~n := #in~n; 1565905#L25 assume !(~n <= 0); 1564762#L26 call #t~ret0 := fact(~n - 1);< 1564779#$Ultimate##0 ~n := #in~n; 1565484#L25 assume !(~n <= 0); 1565418#L26 call #t~ret0 := fact(~n - 1);< 1565423#$Ultimate##0 ~n := #in~n; 1565656#L25 assume !(~n <= 0); 1565653#L26 call #t~ret0 := fact(~n - 1);< 1565655#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564681#factFINAL assume true; 1564308#factEXIT >#82#return; 1564657#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1566539#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1566537#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1566535#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1565298#L42-4 havoc main_~k~0#1; 1565296#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1565295#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1565294#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1565292#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1563998#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564043#$Ultimate##0 ~n := #in~n; 1564040#L25 assume !(~n <= 0); 1564037#L26 call #t~ret0 := fact(~n - 1);< 1564038#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564246#L25 assume ~n <= 0;#res := 1; 1564276#factFINAL assume true; 1564264#factEXIT >#70#return; 1564263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564244#factFINAL assume true; 1564241#factEXIT >#70#return; 1564231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564229#factFINAL assume true; 1564227#factEXIT >#72#return; 1563953#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1563994#$Ultimate##0 ~n := #in~n; 1564010#L25 assume ~n <= 0;#res := 1; 1564009#factFINAL assume true; 1563921#factEXIT >#74#return; 1563986#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1564222#$Ultimate##0 ~n := #in~n; 1572313#L25 assume !(~n <= 0); 1558857#L26 call #t~ret0 := fact(~n - 1);< 1572311#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1558944#L25 assume ~n <= 0;#res := 1; 1558945#factFINAL assume true; 1572530#factEXIT >#70#return; 1572529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572527#factFINAL assume true; 1572324#factEXIT >#70#return; 1572325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572348#factFINAL assume true; 1572345#factEXIT >#70#return; 1572346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572526#factFINAL assume true; 1572513#factEXIT >#70#return; 1572514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572525#factFINAL assume true; 1572524#factEXIT >#70#return; 1572523#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572522#factFINAL assume true; 1572518#factEXIT >#70#return; 1572519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572535#factFINAL assume true; 1572464#factEXIT >#70#return; 1558938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1558867#factFINAL assume true; 1558868#factEXIT >#70#return; 1572534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572533#factFINAL assume true; 1558841#factEXIT >#70#return; 1558858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572528#factFINAL assume true; 1572500#factEXIT >#70#return; 1572501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572510#factFINAL assume true; 1572509#factEXIT >#70#return; 1572508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572506#factFINAL assume true; 1572505#factEXIT >#70#return; 1572503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572502#factFINAL assume true; 1572499#factEXIT >#70#return; 1572497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572495#factFINAL assume true; 1572493#factEXIT >#70#return; 1572492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572490#factFINAL assume true; 1572488#factEXIT >#70#return; 1572489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572532#factFINAL assume true; 1572471#factEXIT >#76#return; 1564221#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1565275#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1565274#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1565273#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1565272#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1563751#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1563858#$Ultimate##0 ~n := #in~n; 1563886#L25 assume !(~n <= 0); 1563873#L26 call #t~ret0 := fact(~n - 1);< 1563881#$Ultimate##0 ~n := #in~n; 1564057#L25 assume !(~n <= 0); 1563877#L26 call #t~ret0 := fact(~n - 1);< 1565794#$Ultimate##0 ~n := #in~n; 1563903#L25 assume ~n <= 0;#res := 1; 1563900#factFINAL assume true; 1563890#factEXIT >#70#return; 1563888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1563883#factFINAL assume true; 1563863#factEXIT >#70#return; 1563861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1563859#factFINAL assume true; 1563632#factEXIT >#72#return; 1563857#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1563919#$Ultimate##0 ~n := #in~n; 1563913#L25 assume !(~n <= 0); 1563864#L26 call #t~ret0 := fact(~n - 1);< 1563904#$Ultimate##0 ~n := #in~n; 1563905#L25 assume ~n <= 0;#res := 1; 1564192#factFINAL assume true; 1564155#factEXIT >#70#return; 1564157#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564098#factFINAL assume true; 1564099#factEXIT >#74#return; 1564069#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1564153#$Ultimate##0 ~n := #in~n; 1564247#L25 assume !(~n <= 0); 1564156#L26 call #t~ret0 := fact(~n - 1);< 1564194#$Ultimate##0 ~n := #in~n; 1563905#L25 assume ~n <= 0;#res := 1; 1564192#factFINAL assume true; 1564155#factEXIT >#70#return; 1564160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564186#factFINAL assume true; 1564140#factEXIT >#76#return; 1564148#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1565271#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1565270#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1565269#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1565268#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1563731#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1563858#$Ultimate##0 ~n := #in~n; 1563886#L25 assume !(~n <= 0); 1563873#L26 call #t~ret0 := fact(~n - 1);< 1563881#$Ultimate##0 ~n := #in~n; 1564057#L25 assume !(~n <= 0); 1563877#L26 call #t~ret0 := fact(~n - 1);< 1565794#$Ultimate##0 ~n := #in~n; 1563903#L25 assume ~n <= 0;#res := 1; 1563900#factFINAL assume true; 1563890#factEXIT >#70#return; 1563888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1563883#factFINAL assume true; 1563863#factEXIT >#70#return; 1563861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1563859#factFINAL assume true; 1563632#factEXIT >#72#return; 1563839#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1563995#$Ultimate##0 ~n := #in~n; 1566926#L25 assume !(~n <= 0); 1566919#L26 call #t~ret0 := fact(~n - 1);< 1566925#$Ultimate##0 ~n := #in~n; 1566929#L25 assume ~n <= 0;#res := 1; 1566927#factFINAL assume true; 1566914#factEXIT >#70#return; 1566912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566909#factFINAL assume true; 1566908#factEXIT >#74#return; 1565183#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1565675#$Ultimate##0 ~n := #in~n; 1569668#L25 assume ~n <= 0;#res := 1; 1569663#factFINAL assume true; 1569655#factEXIT >#76#return; 1566773#L30-3 [2023-11-29 01:20:11,994 INFO L750 eck$LassoCheckResult]: Loop: 1566773#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1569654#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1569652#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1569650#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1569649#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1564520#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564682#$Ultimate##0 ~n := #in~n; 1566017#L25 assume !(~n <= 0); 1564763#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564681#factFINAL assume true; 1564308#factEXIT >#78#return; 1564646#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1564802#$Ultimate##0 ~n := #in~n; 1564801#L25 assume !(~n <= 0); 1564790#L26 call #t~ret0 := fact(~n - 1);< 1564800#$Ultimate##0 ~n := #in~n; 1565297#L25 assume ~n <= 0;#res := 1; 1565175#factFINAL assume true; 1564789#factEXIT >#70#return; 1564788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564787#factFINAL assume true; 1564683#factEXIT >#80#return; 1564571#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1564666#$Ultimate##0 ~n := #in~n; 1565905#L25 assume !(~n <= 0); 1564762#L26 call #t~ret0 := fact(~n - 1);< 1564779#$Ultimate##0 ~n := #in~n; 1565484#L25 assume !(~n <= 0); 1565418#L26 call #t~ret0 := fact(~n - 1);< 1565423#$Ultimate##0 ~n := #in~n; 1565656#L25 assume !(~n <= 0); 1565653#L26 call #t~ret0 := fact(~n - 1);< 1565655#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564681#factFINAL assume true; 1564308#factEXIT >#82#return; 1564663#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1572276#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1572275#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1572274#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1572273#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1564309#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564682#$Ultimate##0 ~n := #in~n; 1566017#L25 assume !(~n <= 0); 1564763#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564681#factFINAL assume true; 1564308#factEXIT >#78#return; 1564596#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1564802#$Ultimate##0 ~n := #in~n; 1564801#L25 assume !(~n <= 0); 1564790#L26 call #t~ret0 := fact(~n - 1);< 1564800#$Ultimate##0 ~n := #in~n; 1565656#L25 assume !(~n <= 0); 1565653#L26 call #t~ret0 := fact(~n - 1);< 1565655#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1567709#factFINAL assume true; 1566100#factEXIT >#80#return; 1564548#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1565657#$Ultimate##0 ~n := #in~n; 1565521#L25 assume !(~n <= 0); 1564753#L26 call #t~ret0 := fact(~n - 1);< 1565485#$Ultimate##0 ~n := #in~n; 1565484#L25 assume !(~n <= 0); 1565418#L26 call #t~ret0 := fact(~n - 1);< 1565423#$Ultimate##0 ~n := #in~n; 1565656#L25 assume !(~n <= 0); 1565653#L26 call #t~ret0 := fact(~n - 1);< 1565655#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564681#factFINAL assume true; 1564308#factEXIT >#82#return; 1564658#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1567526#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1567525#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1566703#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1558966#L42-4 havoc main_~k~0#1; 1558967#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1558920#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1558921#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1566175#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1563999#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1564043#$Ultimate##0 ~n := #in~n; 1564040#L25 assume !(~n <= 0); 1564037#L26 call #t~ret0 := fact(~n - 1);< 1564038#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564044#L25 assume !(~n <= 0); 1564242#L26 call #t~ret0 := fact(~n - 1);< 1564245#$Ultimate##0 ~n := #in~n; 1564246#L25 assume ~n <= 0;#res := 1; 1564276#factFINAL assume true; 1564264#factEXIT >#70#return; 1564263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564244#factFINAL assume true; 1564241#factEXIT >#70#return; 1564243#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572389#factFINAL assume true; 1572385#factEXIT >#70#return; 1572383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572381#factFINAL assume true; 1572378#factEXIT >#70#return; 1572376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572375#factFINAL assume true; 1572371#factEXIT >#70#return; 1572369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572368#factFINAL assume true; 1572365#factEXIT >#70#return; 1572366#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572468#factFINAL assume true; 1572373#factEXIT >#70#return; 1572374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572449#factFINAL assume true; 1572446#factEXIT >#70#return; 1572445#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572443#factFINAL assume true; 1572441#factEXIT >#70#return; 1572440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572439#factFINAL assume true; 1572438#factEXIT >#70#return; 1572437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572436#factFINAL assume true; 1572435#factEXIT >#70#return; 1572433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572432#factFINAL assume true; 1572428#factEXIT >#70#return; 1572426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572425#factFINAL assume true; 1572420#factEXIT >#70#return; 1572418#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572417#factFINAL assume true; 1572414#factEXIT >#70#return; 1572415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572434#factFINAL assume true; 1572430#factEXIT >#70#return; 1572431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572459#factFINAL assume true; 1572458#factEXIT >#72#return; 1563959#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1564002#$Ultimate##0 ~n := #in~n; 1564041#L25 assume ~n <= 0;#res := 1; 1564009#factFINAL assume true; 1563921#factEXIT >#74#return; 1563992#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1572457#$Ultimate##0 ~n := #in~n; 1572456#L25 assume !(~n <= 0); 1572397#L26 call #t~ret0 := fact(~n - 1);< 1572402#$Ultimate##0 ~n := #in~n; 1572400#L25 assume !(~n <= 0); 1572392#L26 call #t~ret0 := fact(~n - 1);< 1572395#$Ultimate##0 ~n := #in~n; 1572394#L25 assume !(~n <= 0); 1572388#L26 call #t~ret0 := fact(~n - 1);< 1572391#$Ultimate##0 ~n := #in~n; 1572390#L25 assume !(~n <= 0); 1572382#L26 call #t~ret0 := fact(~n - 1);< 1572387#$Ultimate##0 ~n := #in~n; 1572384#L25 assume !(~n <= 0); 1572377#L26 call #t~ret0 := fact(~n - 1);< 1572380#$Ultimate##0 ~n := #in~n; 1572379#L25 assume !(~n <= 0); 1572353#L26 call #t~ret0 := fact(~n - 1);< 1572357#$Ultimate##0 ~n := #in~n; 1572355#L25 assume !(~n <= 0); 1558853#L26 call #t~ret0 := fact(~n - 1);< 1572350#$Ultimate##0 ~n := #in~n; 1572349#L25 assume !(~n <= 0); 1558846#L26 call #t~ret0 := fact(~n - 1);< 1572347#$Ultimate##0 ~n := #in~n; 1572344#L25 assume !(~n <= 0); 1558843#L26 call #t~ret0 := fact(~n - 1);< 1572339#$Ultimate##0 ~n := #in~n; 1572336#L25 assume !(~n <= 0); 1558851#L26 call #t~ret0 := fact(~n - 1);< 1572334#$Ultimate##0 ~n := #in~n; 1572332#L25 assume !(~n <= 0); 1558854#L26 call #t~ret0 := fact(~n - 1);< 1572330#$Ultimate##0 ~n := #in~n; 1572328#L25 assume !(~n <= 0); 1558842#L26 call #t~ret0 := fact(~n - 1);< 1572327#$Ultimate##0 ~n := #in~n; 1572323#L25 assume !(~n <= 0); 1558848#L26 call #t~ret0 := fact(~n - 1);< 1572316#$Ultimate##0 ~n := #in~n; 1572314#L25 assume !(~n <= 0); 1558844#L26 call #t~ret0 := fact(~n - 1);< 1572312#$Ultimate##0 ~n := #in~n; 1564026#L25 assume !(~n <= 0); 1558855#L26 call #t~ret0 := fact(~n - 1);< 1572310#$Ultimate##0 ~n := #in~n; 1558944#L25 assume ~n <= 0;#res := 1; 1558945#factFINAL assume true; 1572530#factEXIT >#70#return; 1572529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572527#factFINAL assume true; 1572324#factEXIT >#70#return; 1572325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572348#factFINAL assume true; 1572345#factEXIT >#70#return; 1572346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572526#factFINAL assume true; 1572513#factEXIT >#70#return; 1572514#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572525#factFINAL assume true; 1572524#factEXIT >#70#return; 1572523#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572522#factFINAL assume true; 1572518#factEXIT >#70#return; 1572519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572535#factFINAL assume true; 1572464#factEXIT >#70#return; 1558938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1558867#factFINAL assume true; 1558868#factEXIT >#70#return; 1572534#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572533#factFINAL assume true; 1558841#factEXIT >#70#return; 1558858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572528#factFINAL assume true; 1572500#factEXIT >#70#return; 1572501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572510#factFINAL assume true; 1572509#factEXIT >#70#return; 1572508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572506#factFINAL assume true; 1572505#factEXIT >#70#return; 1572503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572502#factFINAL assume true; 1572499#factEXIT >#70#return; 1572497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572495#factFINAL assume true; 1572493#factEXIT >#70#return; 1572492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572490#factFINAL assume true; 1572488#factEXIT >#70#return; 1572489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1572532#factFINAL assume true; 1572471#factEXIT >#76#return; 1564219#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1565367#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1566913#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1566911#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1566910#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1564891#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1558864#$Ultimate##0 ~n := #in~n; 1565669#L25 assume !(~n <= 0); 1564770#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565931#factFINAL assume true; 1565922#factEXIT >#70#return; 1565928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566235#factFINAL assume true; 1566226#factEXIT >#70#return; 1566230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566551#factFINAL assume true; 1566547#factEXIT >#70#return; 1566546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566545#factFINAL assume true; 1566457#factEXIT >#70#return; 1566458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566387#factFINAL assume true; 1566236#factEXIT >#70#return; 1566244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566494#factFINAL assume true; 1566487#factEXIT >#70#return; 1566324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1567214#factFINAL assume true; 1567186#factEXIT >#72#return; 1564959#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1558864#$Ultimate##0 ~n := #in~n; 1565669#L25 assume !(~n <= 0); 1564770#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565931#factFINAL assume true; 1565922#factEXIT >#70#return; 1565928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566235#factFINAL assume true; 1566226#factEXIT >#70#return; 1566230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566551#factFINAL assume true; 1566547#factEXIT >#70#return; 1566546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566545#factFINAL assume true; 1566457#factEXIT >#70#return; 1566458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566387#factFINAL assume true; 1566236#factEXIT >#70#return; 1566244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566494#factFINAL assume true; 1566487#factEXIT >#70#return; 1566324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1567214#factFINAL assume true; 1567186#factEXIT >#74#return; 1565843#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1566824#$Ultimate##0 ~n := #in~n; 1565838#L25 assume !(~n <= 0); 1564757#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565297#L25 assume ~n <= 0;#res := 1; 1565175#factFINAL assume true; 1564789#factEXIT >#70#return; 1564796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566828#factFINAL assume true; 1566794#factEXIT >#76#return; 1566796#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1566906#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1566904#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1566902#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1566900#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1564888#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1558864#$Ultimate##0 ~n := #in~n; 1565669#L25 assume !(~n <= 0); 1564770#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566827#factFINAL assume true; 1566826#factEXIT >#72#return; 1565015#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1558864#$Ultimate##0 ~n := #in~n; 1565669#L25 assume !(~n <= 0); 1564770#L26 call #t~ret0 := fact(~n - 1);< 1565162#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565707#L25 assume !(~n <= 0); 1564760#L26 call #t~ret0 := fact(~n - 1);< 1565706#$Ultimate##0 ~n := #in~n; 1565658#L25 assume ~n <= 0;#res := 1; 1565659#factFINAL assume true; 1565652#factEXIT >#70#return; 1565651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565523#factFINAL assume true; 1565417#factEXIT >#70#return; 1565302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1564816#factFINAL assume true; 1564752#factEXIT >#70#return; 1564776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1565931#factFINAL assume true; 1565922#factEXIT >#70#return; 1565928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566235#factFINAL assume true; 1566226#factEXIT >#70#return; 1566230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566551#factFINAL assume true; 1566547#factEXIT >#70#return; 1566546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566545#factFINAL assume true; 1566457#factEXIT >#70#return; 1566458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566387#factFINAL assume true; 1566236#factEXIT >#70#return; 1566244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1566494#factFINAL assume true; 1566487#factEXIT >#70#return; 1566324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1567214#factFINAL assume true; 1567186#factEXIT >#74#return; 1565494#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1565889#$Ultimate##0 ~n := #in~n; 1565890#L25 assume ~n <= 0;#res := 1; 1566781#factFINAL assume true; 1566765#factEXIT >#76#return; 1566773#L30-3 [2023-11-29 01:20:11,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash -605511752, now seen corresponding path program 22 times [2023-11-29 01:20:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386734405] [2023-11-29 01:20:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:12,040 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634281055] [2023-11-29 01:20:12,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:20:12,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:12,042 INFO L229 MonitoredProcess]: Starting monitored process 581 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:12,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (581)] Waiting until timeout for monitored process [2023-11-29 01:20:13,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:20:13,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:13,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:20:13,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26554 backedges. 6785 proven. 269 refuted. 0 times theorem prover too weak. 19500 trivial. 0 not checked. [2023-11-29 01:20:14,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 26554 backedges. 1175 proven. 432 refuted. 0 times theorem prover too weak. 24947 trivial. 0 not checked. [2023-11-29 01:20:15,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:15,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386734405] [2023-11-29 01:20:15,060 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:15,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634281055] [2023-11-29 01:20:15,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634281055] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:15,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:15,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2023-11-29 01:20:15,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281173908] [2023-11-29 01:20:15,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:15,062 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:20:15,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1973417028, now seen corresponding path program 16 times [2023-11-29 01:20:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207312678] [2023-11-29 01:20:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:15,181 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579778794] [2023-11-29 01:20:15,181 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:20:15,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:15,183 INFO L229 MonitoredProcess]: Starting monitored process 582 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:15,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (582)] Waiting until timeout for monitored process [2023-11-29 01:20:17,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:20:17,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:17,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 01:20:17,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22135 backedges. 4258 proven. 122 refuted. 0 times theorem prover too weak. 17755 trivial. 0 not checked. [2023-11-29 01:20:17,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22135 backedges. 52 proven. 3047 refuted. 0 times theorem prover too weak. 19036 trivial. 0 not checked. [2023-11-29 01:20:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207312678] [2023-11-29 01:20:18,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579778794] [2023-11-29 01:20:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579778794] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:18,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 21 [2023-11-29 01:20:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837832684] [2023-11-29 01:20:18,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:18,606 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:20:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:20:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 01:20:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:20:18,607 INFO L87 Difference]: Start difference. First operand 13703 states and 37979 transitions. cyclomatic complexity: 24362 Second operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 13 states have call successors, (26), 2 states have call predecessors, (26), 9 states have return successors, (30), 11 states have call predecessors, (30), 13 states have call successors, (30) [2023-11-29 01:20:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:19,422 INFO L93 Difference]: Finished difference Result 14513 states and 40785 transitions. [2023-11-29 01:20:19,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14513 states and 40785 transitions. [2023-11-29 01:20:19,618 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1861 [2023-11-29 01:20:19,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14513 states to 14489 states and 40741 transitions. [2023-11-29 01:20:19,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3131 [2023-11-29 01:20:19,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3131 [2023-11-29 01:20:19,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14489 states and 40741 transitions. [2023-11-29 01:20:19,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:20:19,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14489 states and 40741 transitions. [2023-11-29 01:20:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14489 states and 40741 transitions. [2023-11-29 01:20:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14489 to 13960. [2023-11-29 01:20:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13960 states, 8100 states have (on average 1.0225925925925925) internal successors, (8283), 8030 states have internal predecessors, (8283), 4148 states have call successors, (4613), 1801 states have call predecessors, (4613), 1712 states have return successors, (27204), 4128 states have call predecessors, (27204), 4148 states have call successors, (27204) [2023-11-29 01:20:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13960 states to 13960 states and 40100 transitions. [2023-11-29 01:20:20,682 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13960 states and 40100 transitions. [2023-11-29 01:20:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:20:20,683 INFO L428 stractBuchiCegarLoop]: Abstraction has 13960 states and 40100 transitions. [2023-11-29 01:20:20,683 INFO L335 stractBuchiCegarLoop]: ======== Iteration 61 ============ [2023-11-29 01:20:20,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13960 states and 40100 transitions. [2023-11-29 01:20:20,751 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1667 [2023-11-29 01:20:20,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:20:20,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:20:20,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [100, 100, 61, 61, 61, 61, 39, 13, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:20,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [70, 70, 55, 55, 55, 55, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:20,754 INFO L748 eck$LassoCheckResult]: Stem: 1594593#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1594493#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1594494#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1594513#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1594594#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1595115#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1595113#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1595109#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1595110#$Ultimate##0 ~n := #in~n; 1595114#L25 assume ~n <= 0;#res := 1; 1595112#factFINAL assume true; 1595108#factEXIT >#72#return; 1595104#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1595105#$Ultimate##0 ~n := #in~n; 1595111#L25 assume ~n <= 0;#res := 1; 1595107#factFINAL assume true; 1595103#factEXIT >#74#return; 1595100#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1595101#$Ultimate##0 ~n := #in~n; 1595106#L25 assume ~n <= 0;#res := 1; 1595102#factFINAL assume true; 1595099#factEXIT >#76#return; 1595098#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1595096#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1595093#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1595089#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1595087#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1595083#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1595084#$Ultimate##0 ~n := #in~n; 1595095#L25 assume !(~n <= 0); 1595091#L26 call #t~ret0 := fact(~n - 1);< 1595092#$Ultimate##0 ~n := #in~n; 1595097#L25 assume ~n <= 0;#res := 1; 1595094#factFINAL assume true; 1595090#factEXIT >#70#return; 1595088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1595086#factFINAL assume true; 1595082#factEXIT >#78#return; 1595079#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1595080#$Ultimate##0 ~n := #in~n; 1595085#L25 assume ~n <= 0;#res := 1; 1595081#factFINAL assume true; 1595078#factEXIT >#80#return; 1595076#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1595077#$Ultimate##0 ~n := #in~n; 1595735#L25 assume !(~n <= 0); 1595732#L26 call #t~ret0 := fact(~n - 1);< 1595734#$Ultimate##0 ~n := #in~n; 1595741#L25 assume ~n <= 0;#res := 1; 1595742#factFINAL assume true; 1595731#factEXIT >#70#return; 1595730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1595370#factFINAL assume true; 1595075#factEXIT >#82#return; 1595066#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1595063#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1595062#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1595061#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1595060#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1594826#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1594830#$Ultimate##0 ~n := #in~n; 1594848#L25 assume !(~n <= 0); 1594838#L26 call #t~ret0 := fact(~n - 1);< 1594843#$Ultimate##0 ~n := #in~n; 1594858#L25 assume !(~n <= 0); 1594837#L26 call #t~ret0 := fact(~n - 1);< 1594853#$Ultimate##0 ~n := #in~n; 1594859#L25 assume ~n <= 0;#res := 1; 1594857#factFINAL assume true; 1594852#factEXIT >#70#return; 1594850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594845#factFINAL assume true; 1594836#factEXIT >#70#return; 1594834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594832#factFINAL assume true; 1594824#factEXIT >#78#return; 1594829#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1594927#$Ultimate##0 ~n := #in~n; 1595027#L25 assume ~n <= 0;#res := 1; 1595025#factFINAL assume true; 1595023#factEXIT >#80#return; 1594984#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1594986#$Ultimate##0 ~n := #in~n; 1594985#L25 assume !(~n <= 0); 1594959#L26 call #t~ret0 := fact(~n - 1);< 1594963#$Ultimate##0 ~n := #in~n; 1594997#L25 assume !(~n <= 0); 1594958#L26 call #t~ret0 := fact(~n - 1);< 1594994#$Ultimate##0 ~n := #in~n; 1595003#L25 assume ~n <= 0;#res := 1; 1595000#factFINAL assume true; 1594993#factEXIT >#70#return; 1594992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594982#factFINAL assume true; 1594975#factEXIT >#70#return; 1594976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1595034#factFINAL assume true; 1595033#factEXIT >#82#return; 1595021#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1595005#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1595004#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1595001#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1594998#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1594944#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1594947#$Ultimate##0 ~n := #in~n; 1594969#L25 assume !(~n <= 0); 1594956#L26 call #t~ret0 := fact(~n - 1);< 1594963#$Ultimate##0 ~n := #in~n; 1594997#L25 assume !(~n <= 0); 1594958#L26 call #t~ret0 := fact(~n - 1);< 1594994#$Ultimate##0 ~n := #in~n; 1594997#L25 assume !(~n <= 0); 1594958#L26 call #t~ret0 := fact(~n - 1);< 1594994#$Ultimate##0 ~n := #in~n; 1595003#L25 assume ~n <= 0;#res := 1; 1595000#factFINAL assume true; 1594993#factEXIT >#70#return; 1594992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594982#factFINAL assume true; 1594975#factEXIT >#70#return; 1594972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594966#factFINAL assume true; 1594954#factEXIT >#70#return; 1594951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594948#factFINAL assume true; 1594942#factEXIT >#78#return; 1594946#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1594988#$Ultimate##0 ~n := #in~n; 1595026#L25 assume ~n <= 0;#res := 1; 1595024#factFINAL assume true; 1595022#factEXIT >#80#return; 1594893#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1595019#$Ultimate##0 ~n := #in~n; 1595056#L25 assume !(~n <= 0); 1594885#L26 call #t~ret0 := fact(~n - 1);< 1594894#$Ultimate##0 ~n := #in~n; 1595059#L25 assume !(~n <= 0); 1594884#L26 call #t~ret0 := fact(~n - 1);< 1594891#$Ultimate##0 ~n := #in~n; 1594907#L25 assume !(~n <= 0); 1594887#L26 call #t~ret0 := fact(~n - 1);< 1594904#$Ultimate##0 ~n := #in~n; 1594906#L25 assume ~n <= 0;#res := 1; 1594905#factFINAL assume true; 1594903#factEXIT >#70#return; 1594902#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594901#factFINAL assume true; 1594900#factEXIT >#70#return; 1594899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594898#factFINAL assume true; 1594897#factEXIT >#70#return; 1594890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1595036#factFINAL assume true; 1595018#factEXIT >#82#return; 1595016#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1595014#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1595012#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1595010#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1595007#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1594879#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1594880#$Ultimate##0 ~n := #in~n; 1594895#L25 assume !(~n <= 0); 1594886#L26 call #t~ret0 := fact(~n - 1);< 1594891#$Ultimate##0 ~n := #in~n; 1594907#L25 assume !(~n <= 0); 1594887#L26 call #t~ret0 := fact(~n - 1);< 1594904#$Ultimate##0 ~n := #in~n; 1594907#L25 assume !(~n <= 0); 1594887#L26 call #t~ret0 := fact(~n - 1);< 1594904#$Ultimate##0 ~n := #in~n; 1594907#L25 assume !(~n <= 0); 1594887#L26 call #t~ret0 := fact(~n - 1);< 1594904#$Ultimate##0 ~n := #in~n; 1594906#L25 assume ~n <= 0;#res := 1; 1594905#factFINAL assume true; 1594903#factEXIT >#70#return; 1594902#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594901#factFINAL assume true; 1594900#factEXIT >#70#return; 1594899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594898#factFINAL assume true; 1594897#factEXIT >#70#return; 1594896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594892#factFINAL assume true; 1594883#factEXIT >#70#return; 1594882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594881#factFINAL assume true; 1594877#factEXIT >#78#return; 1594862#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1594864#$Ultimate##0 ~n := #in~n; 1596892#L25 assume ~n <= 0;#res := 1; 1596890#factFINAL assume true; 1596886#factEXIT >#80#return; 1596869#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1596883#$Ultimate##0 ~n := #in~n; 1596881#L25 assume !(~n <= 0); 1595761#L26 call #t~ret0 := fact(~n - 1);< 1596856#$Ultimate##0 ~n := #in~n; 1596898#L25 assume !(~n <= 0); 1595753#L26 call #t~ret0 := fact(~n - 1);< 1596895#$Ultimate##0 ~n := #in~n; 1596894#L25 assume !(~n <= 0); 1595756#L26 call #t~ret0 := fact(~n - 1);< 1595849#$Ultimate##0 ~n := #in~n; 1596893#L25 assume !(~n <= 0); 1595772#L26 call #t~ret0 := fact(~n - 1);< 1596888#$Ultimate##0 ~n := #in~n; 1596891#L25 assume ~n <= 0;#res := 1; 1596889#factFINAL assume true; 1596887#factEXIT >#70#return; 1596885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1596884#factFINAL assume true; 1596882#factEXIT >#70#return; 1596880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1596878#factFINAL assume true; 1596871#factEXIT >#70#return; 1596870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1596868#factFINAL assume true; 1596864#factEXIT >#70#return; 1596865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599741#factFINAL assume true; 1599735#factEXIT >#82#return; 1596396#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1599675#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1599674#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1599673#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1594601#L42-4 havoc main_~k~0#1; 1599669#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1599664#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1599662#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1599656#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1599584#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1599644#$Ultimate##0 ~n := #in~n; 1599667#L25 assume !(~n <= 0); 1599660#L26 call #t~ret0 := fact(~n - 1);< 1599661#$Ultimate##0 ~n := #in~n; 1599670#L25 assume ~n <= 0;#res := 1; 1599666#factFINAL assume true; 1599659#factEXIT >#70#return; 1599655#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599654#factFINAL assume true; 1599645#factEXIT >#72#return; 1599583#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1599641#$Ultimate##0 ~n := #in~n; 1599653#L25 assume ~n <= 0;#res := 1; 1599643#factFINAL assume true; 1599582#factEXIT >#74#return; 1599579#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1599580#$Ultimate##0 ~n := #in~n; 1599658#L25 assume !(~n <= 0); 1594462#L26 call #t~ret0 := fact(~n - 1);< 1599652#$Ultimate##0 ~n := #in~n; 1599663#L25 assume ~n <= 0;#res := 1; 1599657#factFINAL assume true; 1599651#factEXIT >#70#return; 1599642#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599581#factFINAL assume true; 1599578#factEXIT >#76#return; 1599577#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1599576#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1599575#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1599574#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1599572#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1599330#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1599534#$Ultimate##0 ~n := #in~n; 1599564#L25 assume !(~n <= 0); 1599548#L26 call #t~ret0 := fact(~n - 1);< 1599559#$Ultimate##0 ~n := #in~n; 1599867#L25 assume ~n <= 0;#res := 1; 1599800#factFINAL assume true; 1599802#factEXIT >#70#return; 1599854#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600295#factFINAL assume true; 1600246#factEXIT >#72#return; 1599678#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1599260#$Ultimate##0 ~n := #in~n; 1599795#L25 assume !(~n <= 0); 1599541#L26 call #t~ret0 := fact(~n - 1);< 1599856#$Ultimate##0 ~n := #in~n; 1599867#L25 assume ~n <= 0;#res := 1; 1599800#factFINAL assume true; 1599802#factEXIT >#70#return; 1599851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599677#factFINAL assume true; 1599679#factEXIT >#74#return; 1599749#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1599849#$Ultimate##0 ~n := #in~n; 1599845#L25 assume ~n <= 0;#res := 1; 1599846#factFINAL assume true; 1599974#factEXIT >#76#return; 1599975#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1601539#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1601538#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1601537#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1601536#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1599904#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1599916#$Ultimate##0 ~n := #in~n; 1599946#L25 assume !(~n <= 0); 1599768#L26 call #t~ret0 := fact(~n - 1);< 1599794#$Ultimate##0 ~n := #in~n; 1600039#L25 assume !(~n <= 0); 1599769#L26 call #t~ret0 := fact(~n - 1);< 1600061#$Ultimate##0 ~n := #in~n; 1599868#L25 assume ~n <= 0;#res := 1; 1599866#factFINAL assume true; 1599862#factEXIT >#70#return; 1599860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599858#factFINAL assume true; 1599767#factEXIT >#70#return; 1599789#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600050#factFINAL assume true; 1599897#factEXIT >#78#return; 1599841#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1600091#$Ultimate##0 ~n := #in~n; 1601528#L25 assume !(~n <= 0); 1600875#L26 call #t~ret0 := fact(~n - 1);< 1600917#$Ultimate##0 ~n := #in~n; 1600991#L25 assume ~n <= 0;#res := 1; 1600885#factFINAL assume true; 1600869#factEXIT >#70#return; 1600879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601521#factFINAL assume true; 1601459#factEXIT >#80#return; 1600974#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1600978#$Ultimate##0 ~n := #in~n; 1601526#L25 assume !(~n <= 0); 1600871#L26 call #t~ret0 := fact(~n - 1);< 1600917#$Ultimate##0 ~n := #in~n; 1600991#L25 assume ~n <= 0;#res := 1; 1600885#factFINAL assume true; 1600869#factEXIT >#70#return; 1600877#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601458#factFINAL assume true; 1600968#factEXIT >#82#return; 1600977#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1603453#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1603437#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1603251#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1603250#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1600599#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1600735#$Ultimate##0 ~n := #in~n; 1601972#L25 assume !(~n <= 0); 1600838#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600734#factFINAL assume true; 1600388#factEXIT >#78#return; 1600719#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1600809#$Ultimate##0 ~n := #in~n; 1601456#L25 assume !(~n <= 0); 1600872#L26 call #t~ret0 := fact(~n - 1);< 1600880#$Ultimate##0 ~n := #in~n; 1600991#L25 assume ~n <= 0;#res := 1; 1600885#factFINAL assume true; 1600869#factEXIT >#70#return; 1600846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600808#factFINAL assume true; 1600737#factEXIT >#80#return; 1600787#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1601768#$Ultimate##0 ~n := #in~n; 1601762#L25 assume !(~n <= 0); 1600981#L26 call #t~ret0 := fact(~n - 1);< 1601509#$Ultimate##0 ~n := #in~n; 1601545#L25 assume !(~n <= 0); 1601518#L26 call #t~ret0 := fact(~n - 1);< 1601520#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601822#factFINAL assume true; 1601783#factEXIT >#82#return; 1601785#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1603745#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1603736#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1603732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1603730#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1600610#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1600735#$Ultimate##0 ~n := #in~n; 1601972#L25 assume !(~n <= 0); 1600838#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600992#factFINAL assume true; 1600951#factEXIT >#70#return; 1600882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600847#factFINAL assume true; 1600810#factEXIT >#78#return; 1600601#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1600735#$Ultimate##0 ~n := #in~n; 1601972#L25 assume !(~n <= 0); 1600838#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1600991#L25 assume ~n <= 0;#res := 1; 1600885#factFINAL assume true; 1600869#factEXIT >#70#return; 1600846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600808#factFINAL assume true; 1600737#factEXIT >#80#return; 1600607#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1600733#$Ultimate##0 ~n := #in~n; 1602888#L25 assume !(~n <= 0); 1600835#L26 call #t~ret0 := fact(~n - 1);< 1600845#$Ultimate##0 ~n := #in~n; 1601511#L25 assume !(~n <= 0); 1600982#L26 call #t~ret0 := fact(~n - 1);< 1600990#$Ultimate##0 ~n := #in~n; 1601545#L25 assume !(~n <= 0); 1601518#L26 call #t~ret0 := fact(~n - 1);< 1601520#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600734#factFINAL assume true; 1600388#factEXIT >#82#return; 1600721#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1602382#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1602381#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1602380#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1600034#L42-4 havoc main_~k~0#1; 1600032#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1600029#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1600025#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1600023#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1599649#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1599671#$Ultimate##0 ~n := #in~n; 1599668#L25 assume !(~n <= 0); 1599660#L26 call #t~ret0 := fact(~n - 1);< 1599661#$Ultimate##0 ~n := #in~n; 1599672#L25 assume !(~n <= 0); 1600027#L26 call #t~ret0 := fact(~n - 1);< 1600031#$Ultimate##0 ~n := #in~n; 1600036#L25 assume ~n <= 0;#res := 1; 1600038#factFINAL assume true; 1600035#factEXIT >#70#return; 1600033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600030#factFINAL assume true; 1600026#factEXIT >#70#return; 1600024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600022#factFINAL assume true; 1600021#factEXIT >#72#return; 1599592#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1599641#$Ultimate##0 ~n := #in~n; 1599653#L25 assume ~n <= 0;#res := 1; 1599643#factFINAL assume true; 1599582#factEXIT >#74#return; 1594524#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1600020#$Ultimate##0 ~n := #in~n; 1608118#L25 assume !(~n <= 0); 1594461#L26 call #t~ret0 := fact(~n - 1);< 1608112#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1594579#L25 assume ~n <= 0;#res := 1; 1594580#factFINAL assume true; 1608366#factEXIT >#70#return; 1608365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608363#factFINAL assume true; 1608359#factEXIT >#70#return; 1608358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608355#factFINAL assume true; 1608351#factEXIT >#70#return; 1608352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608368#factFINAL assume true; 1608349#factEXIT >#70#return; 1608350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608367#factFINAL assume true; 1608364#factEXIT >#70#return; 1608362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608361#factFINAL assume true; 1608356#factEXIT >#70#return; 1608357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608413#factFINAL assume true; 1594458#factEXIT >#70#return; 1594472#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608409#factFINAL assume true; 1608407#factEXIT >#70#return; 1608405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608403#factFINAL assume true; 1608399#factEXIT >#70#return; 1608400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594485#factFINAL assume true; 1594491#factEXIT >#70#return; 1608380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608344#factFINAL assume true; 1608342#factEXIT >#76#return; 1600014#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1600013#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1600012#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1600011#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1600010#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1599397#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1599534#$Ultimate##0 ~n := #in~n; 1599564#L25 assume !(~n <= 0); 1599548#L26 call #t~ret0 := fact(~n - 1);< 1599559#$Ultimate##0 ~n := #in~n; 1604649#L25 assume !(~n <= 0); 1599551#L26 call #t~ret0 := fact(~n - 1);< 1604648#$Ultimate##0 ~n := #in~n; 1599573#L25 assume ~n <= 0;#res := 1; 1599571#factFINAL assume true; 1599567#factEXIT >#70#return; 1599566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599561#factFINAL assume true; 1599539#factEXIT >#70#return; 1599537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599535#factFINAL assume true; 1599285#factEXIT >#72#return; 1599515#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1599260#$Ultimate##0 ~n := #in~n; 1599795#L25 assume !(~n <= 0); 1599541#L26 call #t~ret0 := fact(~n - 1);< 1599856#$Ultimate##0 ~n := #in~n; 1599867#L25 assume ~n <= 0;#res := 1; 1599800#factFINAL assume true; 1599802#factEXIT >#70#return; 1599851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599677#factFINAL assume true; 1599679#factEXIT >#74#return; 1599752#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1599850#$Ultimate##0 ~n := #in~n; 1600117#L25 assume !(~n <= 0); 1599801#L26 call #t~ret0 := fact(~n - 1);< 1599810#$Ultimate##0 ~n := #in~n; 1599867#L25 assume ~n <= 0;#res := 1; 1599800#factFINAL assume true; 1599802#factEXIT >#70#return; 1599855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600009#factFINAL assume true; 1599993#factEXIT >#76#return; 1599992#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1599991#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1599989#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1599987#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1599985#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1599410#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1599534#$Ultimate##0 ~n := #in~n; 1599564#L25 assume !(~n <= 0); 1599548#L26 call #t~ret0 := fact(~n - 1);< 1599559#$Ultimate##0 ~n := #in~n; 1604649#L25 assume !(~n <= 0); 1599551#L26 call #t~ret0 := fact(~n - 1);< 1604648#$Ultimate##0 ~n := #in~n; 1599573#L25 assume ~n <= 0;#res := 1; 1599571#factFINAL assume true; 1599567#factEXIT >#70#return; 1599566#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599561#factFINAL assume true; 1599539#factEXIT >#70#return; 1599537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1599535#factFINAL assume true; 1599285#factEXIT >#72#return; 1599528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1599261#$Ultimate##0 ~n := #in~n; 1603321#L25 assume !(~n <= 0); 1603310#L26 call #t~ret0 := fact(~n - 1);< 1603320#$Ultimate##0 ~n := #in~n; 1603325#L25 assume ~n <= 0;#res := 1; 1603322#factFINAL assume true; 1603308#factEXIT >#70#return; 1603307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1603305#factFINAL assume true; 1603304#factEXIT >#74#return; 1600892#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1603287#$Ultimate##0 ~n := #in~n; 1603420#L25 assume ~n <= 0;#res := 1; 1603418#factFINAL assume true; 1603270#factEXIT >#76#return; 1603262#L30-3 [2023-11-29 01:20:20,755 INFO L750 eck$LassoCheckResult]: Loop: 1603262#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1603260#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1603259#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1603258#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1603257#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1600407#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1600735#$Ultimate##0 ~n := #in~n; 1601972#L25 assume !(~n <= 0); 1600838#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600734#factFINAL assume true; 1600388#factEXIT >#78#return; 1600682#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1600809#$Ultimate##0 ~n := #in~n; 1601456#L25 assume !(~n <= 0); 1600872#L26 call #t~ret0 := fact(~n - 1);< 1600880#$Ultimate##0 ~n := #in~n; 1600991#L25 assume ~n <= 0;#res := 1; 1600885#factFINAL assume true; 1600869#factEXIT >#70#return; 1600846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600808#factFINAL assume true; 1600737#factEXIT >#80#return; 1600786#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1601768#$Ultimate##0 ~n := #in~n; 1601762#L25 assume !(~n <= 0); 1600981#L26 call #t~ret0 := fact(~n - 1);< 1601509#$Ultimate##0 ~n := #in~n; 1601545#L25 assume !(~n <= 0); 1601518#L26 call #t~ret0 := fact(~n - 1);< 1601520#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601822#factFINAL assume true; 1601783#factEXIT >#82#return; 1601784#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1608082#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1608075#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1608076#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1608077#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1600561#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1600735#$Ultimate##0 ~n := #in~n; 1601972#L25 assume !(~n <= 0); 1600838#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600992#factFINAL assume true; 1600951#factEXIT >#70#return; 1600882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600847#factFINAL assume true; 1600810#factEXIT >#78#return; 1600413#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1600735#$Ultimate##0 ~n := #in~n; 1601972#L25 assume !(~n <= 0); 1600838#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1600991#L25 assume ~n <= 0;#res := 1; 1600885#factFINAL assume true; 1600869#factEXIT >#70#return; 1600846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600808#factFINAL assume true; 1600737#factEXIT >#80#return; 1600409#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1600733#$Ultimate##0 ~n := #in~n; 1602888#L25 assume !(~n <= 0); 1600835#L26 call #t~ret0 := fact(~n - 1);< 1600845#$Ultimate##0 ~n := #in~n; 1601511#L25 assume !(~n <= 0); 1600982#L26 call #t~ret0 := fact(~n - 1);< 1600990#$Ultimate##0 ~n := #in~n; 1601545#L25 assume !(~n <= 0); 1601518#L26 call #t~ret0 := fact(~n - 1);< 1601520#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600807#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600734#factFINAL assume true; 1600388#factEXIT >#82#return; 1600684#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1608132#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1608130#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1603510#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1594599#L42-4 havoc main_~k~0#1; 1594512#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1594506#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1594507#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1605583#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1599647#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1599671#$Ultimate##0 ~n := #in~n; 1599668#L25 assume !(~n <= 0); 1599660#L26 call #t~ret0 := fact(~n - 1);< 1599661#$Ultimate##0 ~n := #in~n; 1599672#L25 assume !(~n <= 0); 1600027#L26 call #t~ret0 := fact(~n - 1);< 1600031#$Ultimate##0 ~n := #in~n; 1599672#L25 assume !(~n <= 0); 1600027#L26 call #t~ret0 := fact(~n - 1);< 1600031#$Ultimate##0 ~n := #in~n; 1600036#L25 assume ~n <= 0;#res := 1; 1600038#factFINAL assume true; 1600035#factEXIT >#70#return; 1600033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600030#factFINAL assume true; 1600026#factEXIT >#70#return; 1600028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608230#factFINAL assume true; 1608225#factEXIT >#70#return; 1608223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608222#factFINAL assume true; 1608218#factEXIT >#72#return; 1599609#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1599644#$Ultimate##0 ~n := #in~n; 1599667#L25 assume ~n <= 0;#res := 1; 1599643#factFINAL assume true; 1599582#factEXIT >#74#return; 1594534#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1608140#$Ultimate##0 ~n := #in~n; 1608139#L25 assume !(~n <= 0); 1594470#L26 call #t~ret0 := fact(~n - 1);< 1608136#$Ultimate##0 ~n := #in~n; 1608135#L25 assume !(~n <= 0); 1594464#L26 call #t~ret0 := fact(~n - 1);< 1608113#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1599665#L25 assume !(~n <= 0); 1594463#L26 call #t~ret0 := fact(~n - 1);< 1608108#$Ultimate##0 ~n := #in~n; 1594579#L25 assume ~n <= 0;#res := 1; 1594580#factFINAL assume true; 1608366#factEXIT >#70#return; 1608365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608363#factFINAL assume true; 1608359#factEXIT >#70#return; 1608358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608355#factFINAL assume true; 1608351#factEXIT >#70#return; 1608352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608368#factFINAL assume true; 1608349#factEXIT >#70#return; 1608350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608367#factFINAL assume true; 1608364#factEXIT >#70#return; 1608362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608361#factFINAL assume true; 1608356#factEXIT >#70#return; 1608357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1608413#factFINAL assume true; 1594458#factEXIT >#70#return; 1594473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1594540#factFINAL assume true; 1608105#factEXIT >#76#return; 1600018#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1603384#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1603383#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1603378#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1603377#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1601041#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1594482#$Ultimate##0 ~n := #in~n; 1601451#L25 assume !(~n <= 0); 1600840#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600992#factFINAL assume true; 1600951#factEXIT >#70#return; 1600957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602182#factFINAL assume true; 1602169#factEXIT >#70#return; 1602165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602145#factFINAL assume true; 1602130#factEXIT >#70#return; 1602129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602128#factFINAL assume true; 1602125#factEXIT >#70#return; 1602122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602120#factFINAL assume true; 1602111#factEXIT >#70#return; 1602110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602107#factFINAL assume true; 1602099#factEXIT >#70#return; 1602098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602097#factFINAL assume true; 1602094#factEXIT >#70#return; 1602095#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602224#factFINAL assume true; 1602016#factEXIT >#70#return; 1602017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602096#factFINAL assume true; 1602090#factEXIT >#70#return; 1602044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602042#factFINAL assume true; 1602041#factEXIT >#70#return; 1602039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602037#factFINAL assume true; 1602008#factEXIT >#70#return; 1601881#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1603457#factFINAL assume true; 1603450#factEXIT >#72#return; 1601181#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1594482#$Ultimate##0 ~n := #in~n; 1601451#L25 assume !(~n <= 0); 1600840#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600992#factFINAL assume true; 1600951#factEXIT >#70#return; 1600957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602182#factFINAL assume true; 1602169#factEXIT >#70#return; 1602165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602145#factFINAL assume true; 1602130#factEXIT >#70#return; 1602129#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602128#factFINAL assume true; 1602125#factEXIT >#70#return; 1602122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602120#factFINAL assume true; 1602111#factEXIT >#70#return; 1602110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1602107#factFINAL assume true; 1602099#factEXIT >#70#return; 1602018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1603512#factFINAL assume true; 1603513#factEXIT >#74#return; 1601931#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1603363#$Ultimate##0 ~n := #in~n; 1601997#L25 assume !(~n <= 0); 1600821#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1600991#L25 assume ~n <= 0;#res := 1; 1600885#factFINAL assume true; 1600869#factEXIT >#70#return; 1600876#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1603394#factFINAL assume true; 1603326#factEXIT >#76#return; 1603324#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1603297#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1603295#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1603293#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1603292#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1601085#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1594482#$Ultimate##0 ~n := #in~n; 1601451#L25 assume !(~n <= 0); 1600840#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1603294#factFINAL assume true; 1603291#factEXIT >#72#return; 1601080#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1594482#$Ultimate##0 ~n := #in~n; 1601451#L25 assume !(~n <= 0); 1600840#L26 call #t~ret0 := fact(~n - 1);< 1601416#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601976#L25 assume !(~n <= 0); 1600829#L26 call #t~ret0 := fact(~n - 1);< 1601967#$Ultimate##0 ~n := #in~n; 1601524#L25 assume ~n <= 0;#res := 1; 1601522#factFINAL assume true; 1601517#factEXIT >#70#return; 1601516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1601460#factFINAL assume true; 1600979#factEXIT >#70#return; 1600884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600851#factFINAL assume true; 1600818#factEXIT >#70#return; 1600843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1600992#factFINAL assume true; 1600951#factEXIT >#70#return; 1600959#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1603476#factFINAL assume true; 1603448#factEXIT >#74#return; 1601463#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1601824#$Ultimate##0 ~n := #in~n; 1601825#L25 assume ~n <= 0;#res := 1; 1603431#factFINAL assume true; 1603271#factEXIT >#76#return; 1603262#L30-3 [2023-11-29 01:20:20,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash 474740216, now seen corresponding path program 23 times [2023-11-29 01:20:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113748016] [2023-11-29 01:20:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:20,799 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703454296] [2023-11-29 01:20:20,799 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:20:20,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:20,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:20,801 INFO L229 MonitoredProcess]: Starting monitored process 583 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:20,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (583)] Waiting until timeout for monitored process [2023-11-29 01:20:24,718 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2023-11-29 01:20:24,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:24,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 01:20:24,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23884 backedges. 6622 proven. 390 refuted. 0 times theorem prover too weak. 16872 trivial. 0 not checked. [2023-11-29 01:20:24,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23884 backedges. 3222 proven. 736 refuted. 0 times theorem prover too weak. 19926 trivial. 0 not checked. [2023-11-29 01:20:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:26,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113748016] [2023-11-29 01:20:26,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:26,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703454296] [2023-11-29 01:20:26,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703454296] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:26,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:26,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 32 [2023-11-29 01:20:26,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589096646] [2023-11-29 01:20:26,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:26,895 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:20:26,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash -376422652, now seen corresponding path program 17 times [2023-11-29 01:20:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095420317] [2023-11-29 01:20:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:26,935 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717654195] [2023-11-29 01:20:26,935 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:20:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:26,937 INFO L229 MonitoredProcess]: Starting monitored process 584 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:26,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (584)] Waiting until timeout for monitored process [2023-11-29 01:20:28,935 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2023-11-29 01:20:28,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:28,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 01:20:28,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12685 backedges. 7223 proven. 222 refuted. 0 times theorem prover too weak. 5240 trivial. 0 not checked. [2023-11-29 01:20:29,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12685 backedges. 853 proven. 1752 refuted. 0 times theorem prover too weak. 10080 trivial. 0 not checked. [2023-11-29 01:20:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095420317] [2023-11-29 01:20:31,363 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717654195] [2023-11-29 01:20:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717654195] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:31,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:31,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 32 [2023-11-29 01:20:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669265028] [2023-11-29 01:20:31,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:31,365 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:20:31,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:20:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 01:20:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2023-11-29 01:20:31,366 INFO L87 Difference]: Start difference. First operand 13960 states and 40100 transitions. cyclomatic complexity: 26226 Second operand has 32 states, 28 states have (on average 3.0) internal successors, (84), 32 states have internal predecessors, (84), 18 states have call successors, (34), 2 states have call predecessors, (34), 11 states have return successors, (39), 16 states have call predecessors, (39), 18 states have call successors, (39) [2023-11-29 01:20:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:33,489 INFO L93 Difference]: Finished difference Result 23509 states and 79166 transitions. [2023-11-29 01:20:33,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23509 states and 79166 transitions. [2023-11-29 01:20:34,053 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 6087 [2023-11-29 01:20:34,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23509 states to 22574 states and 76394 transitions. [2023-11-29 01:20:34,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8044 [2023-11-29 01:20:34,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8057 [2023-11-29 01:20:34,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22574 states and 76394 transitions. [2023-11-29 01:20:34,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:20:34,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22574 states and 76394 transitions. [2023-11-29 01:20:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states and 76394 transitions. [2023-11-29 01:20:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 18754. [2023-11-29 01:20:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18754 states, 9888 states have (on average 1.0318567961165048) internal successors, (10203), 9809 states have internal predecessors, (10203), 7154 states have call successors, (7901), 1801 states have call predecessors, (7901), 1712 states have return successors, (43937), 7143 states have call predecessors, (43937), 7154 states have call successors, (43937) [2023-11-29 01:20:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18754 states to 18754 states and 62041 transitions. [2023-11-29 01:20:35,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18754 states and 62041 transitions. [2023-11-29 01:20:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-29 01:20:35,436 INFO L428 stractBuchiCegarLoop]: Abstraction has 18754 states and 62041 transitions. [2023-11-29 01:20:35,436 INFO L335 stractBuchiCegarLoop]: ======== Iteration 62 ============ [2023-11-29 01:20:35,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18754 states and 62041 transitions. [2023-11-29 01:20:35,551 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 4456 [2023-11-29 01:20:35,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:20:35,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:20:35,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [72, 72, 42, 42, 42, 42, 30, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:35,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [39, 39, 24, 24, 24, 24, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:35,556 INFO L748 eck$LassoCheckResult]: Stem: 1638680#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1638624#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1638625#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1638642#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1638681#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1639170#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1639168#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1639164#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1639165#$Ultimate##0 ~n := #in~n; 1639169#L25 assume ~n <= 0;#res := 1; 1639167#factFINAL assume true; 1639163#factEXIT >#72#return; 1639159#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1639160#$Ultimate##0 ~n := #in~n; 1639166#L25 assume ~n <= 0;#res := 1; 1639162#factFINAL assume true; 1639158#factEXIT >#74#return; 1639155#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1639156#$Ultimate##0 ~n := #in~n; 1639161#L25 assume ~n <= 0;#res := 1; 1639157#factFINAL assume true; 1639154#factEXIT >#76#return; 1639153#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1639151#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1639148#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1639144#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1639142#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1639137#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1639138#$Ultimate##0 ~n := #in~n; 1639150#L25 assume !(~n <= 0); 1639146#L26 call #t~ret0 := fact(~n - 1);< 1639147#$Ultimate##0 ~n := #in~n; 1639152#L25 assume ~n <= 0;#res := 1; 1639149#factFINAL assume true; 1639145#factEXIT >#70#return; 1639143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639141#factFINAL assume true; 1639136#factEXIT >#78#return; 1639133#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1639134#$Ultimate##0 ~n := #in~n; 1639140#L25 assume ~n <= 0;#res := 1; 1639135#factFINAL assume true; 1639132#factEXIT >#80#return; 1639130#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1639131#$Ultimate##0 ~n := #in~n; 1639822#L25 assume !(~n <= 0); 1639819#L26 call #t~ret0 := fact(~n - 1);< 1639821#$Ultimate##0 ~n := #in~n; 1639827#L25 assume ~n <= 0;#res := 1; 1639823#factFINAL assume true; 1639818#factEXIT >#70#return; 1639817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639781#factFINAL assume true; 1639129#factEXIT >#82#return; 1639127#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1639118#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1639116#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1639114#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1639111#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1638906#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1638910#$Ultimate##0 ~n := #in~n; 1638928#L25 assume !(~n <= 0); 1638920#L26 call #t~ret0 := fact(~n - 1);< 1638924#$Ultimate##0 ~n := #in~n; 1638938#L25 assume !(~n <= 0); 1638919#L26 call #t~ret0 := fact(~n - 1);< 1638933#$Ultimate##0 ~n := #in~n; 1638939#L25 assume ~n <= 0;#res := 1; 1638937#factFINAL assume true; 1638932#factEXIT >#70#return; 1638930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1638926#factFINAL assume true; 1638917#factEXIT >#70#return; 1638915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1638913#factFINAL assume true; 1638904#factEXIT >#78#return; 1638909#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1639061#$Ultimate##0 ~n := #in~n; 1639091#L25 assume ~n <= 0;#res := 1; 1639089#factFINAL assume true; 1639060#factEXIT >#80#return; 1639054#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1639057#$Ultimate##0 ~n := #in~n; 1639070#L25 assume !(~n <= 0); 1639040#L26 call #t~ret0 := fact(~n - 1);< 1639046#$Ultimate##0 ~n := #in~n; 1639088#L25 assume !(~n <= 0); 1639038#L26 call #t~ret0 := fact(~n - 1);< 1639086#$Ultimate##0 ~n := #in~n; 1639092#L25 assume ~n <= 0;#res := 1; 1639090#factFINAL assume true; 1639085#factEXIT >#70#return; 1639084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639068#factFINAL assume true; 1639064#factEXIT >#70#return; 1639065#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639087#factFINAL assume true; 1639083#factEXIT >#82#return; 1639056#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1639059#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1639052#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1639047#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1639035#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1638946#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1638950#$Ultimate##0 ~n := #in~n; 1639051#L25 assume !(~n <= 0); 1639041#L26 call #t~ret0 := fact(~n - 1);< 1639046#$Ultimate##0 ~n := #in~n; 1639088#L25 assume !(~n <= 0); 1639038#L26 call #t~ret0 := fact(~n - 1);< 1639086#$Ultimate##0 ~n := #in~n; 1639088#L25 assume !(~n <= 0); 1639038#L26 call #t~ret0 := fact(~n - 1);< 1639086#$Ultimate##0 ~n := #in~n; 1639092#L25 assume ~n <= 0;#res := 1; 1639090#factFINAL assume true; 1639085#factEXIT >#70#return; 1639084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639068#factFINAL assume true; 1639064#factEXIT >#70#return; 1639058#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639049#factFINAL assume true; 1639037#factEXIT >#70#return; 1639034#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639031#factFINAL assume true; 1638945#factEXIT >#78#return; 1638949#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1638965#$Ultimate##0 ~n := #in~n; 1639001#L25 assume ~n <= 0;#res := 1; 1639000#factFINAL assume true; 1638998#factEXIT >#80#return; 1638996#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1638997#$Ultimate##0 ~n := #in~n; 1639024#L25 assume !(~n <= 0); 1638988#L26 call #t~ret0 := fact(~n - 1);< 1639023#$Ultimate##0 ~n := #in~n; 1639022#L25 assume !(~n <= 0); 1638986#L26 call #t~ret0 := fact(~n - 1);< 1638991#$Ultimate##0 ~n := #in~n; 1639019#L25 assume !(~n <= 0); 1638984#L26 call #t~ret0 := fact(~n - 1);< 1639018#$Ultimate##0 ~n := #in~n; 1639021#L25 assume ~n <= 0;#res := 1; 1639020#factFINAL assume true; 1639017#factEXIT >#70#return; 1639016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639015#factFINAL assume true; 1639013#factEXIT >#70#return; 1639011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639010#factFINAL assume true; 1639008#factEXIT >#70#return; 1638990#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639125#factFINAL assume true; 1638995#factEXIT >#82#return; 1638994#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1638992#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1638982#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1638980#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1638979#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1638974#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1638976#$Ultimate##0 ~n := #in~n; 1638993#L25 assume !(~n <= 0); 1638987#L26 call #t~ret0 := fact(~n - 1);< 1638991#$Ultimate##0 ~n := #in~n; 1639019#L25 assume !(~n <= 0); 1638984#L26 call #t~ret0 := fact(~n - 1);< 1639018#$Ultimate##0 ~n := #in~n; 1639019#L25 assume !(~n <= 0); 1638984#L26 call #t~ret0 := fact(~n - 1);< 1639018#$Ultimate##0 ~n := #in~n; 1639019#L25 assume !(~n <= 0); 1638984#L26 call #t~ret0 := fact(~n - 1);< 1639018#$Ultimate##0 ~n := #in~n; 1639021#L25 assume ~n <= 0;#res := 1; 1639020#factFINAL assume true; 1639017#factEXIT >#70#return; 1639016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639015#factFINAL assume true; 1639013#factEXIT >#70#return; 1639011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639010#factFINAL assume true; 1639008#factEXIT >#70#return; 1639007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1639005#factFINAL assume true; 1638983#factEXIT >#70#return; 1638981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1638978#factFINAL assume true; 1638973#factEXIT >#78#return; 1638969#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1638972#$Ultimate##0 ~n := #in~n; 1641161#L25 assume ~n <= 0;#res := 1; 1641160#factFINAL assume true; 1641159#factEXIT >#80#return; 1641078#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1641096#$Ultimate##0 ~n := #in~n; 1641092#L25 assume !(~n <= 0); 1639840#L26 call #t~ret0 := fact(~n - 1);< 1641067#$Ultimate##0 ~n := #in~n; 1641128#L25 assume !(~n <= 0); 1639843#L26 call #t~ret0 := fact(~n - 1);< 1641084#$Ultimate##0 ~n := #in~n; 1641137#L25 assume !(~n <= 0); 1639858#L26 call #t~ret0 := fact(~n - 1);< 1639930#$Ultimate##0 ~n := #in~n; 1641102#L25 assume !(~n <= 0); 1639851#L26 call #t~ret0 := fact(~n - 1);< 1641101#$Ultimate##0 ~n := #in~n; 1641104#L25 assume ~n <= 0;#res := 1; 1641103#factFINAL assume true; 1641100#factEXIT >#70#return; 1641099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1641098#factFINAL assume true; 1641093#factEXIT >#70#return; 1641089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1641087#factFINAL assume true; 1641082#factEXIT >#70#return; 1641080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1641077#factFINAL assume true; 1641071#factEXIT >#70#return; 1641072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644977#factFINAL assume true; 1644975#factEXIT >#82#return; 1640652#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1644968#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1644967#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1644965#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1638688#L42-4 havoc main_~k~0#1; 1644929#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1644927#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1644925#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1644924#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1644871#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1644923#$Ultimate##0 ~n := #in~n; 1644939#L25 assume !(~n <= 0); 1644931#L26 call #t~ret0 := fact(~n - 1);< 1644932#$Ultimate##0 ~n := #in~n; 1644935#L25 assume ~n <= 0;#res := 1; 1644934#factFINAL assume true; 1644930#factEXIT >#70#return; 1644928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644926#factFINAL assume true; 1644912#factEXIT >#72#return; 1644870#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1644911#$Ultimate##0 ~n := #in~n; 1644938#L25 assume ~n <= 0;#res := 1; 1644937#factFINAL assume true; 1644811#factEXIT >#74#return; 1644809#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1644810#$Ultimate##0 ~n := #in~n; 1644946#L25 assume !(~n <= 0); 1644943#L26 call #t~ret0 := fact(~n - 1);< 1644944#$Ultimate##0 ~n := #in~n; 1644948#L25 assume ~n <= 0;#res := 1; 1644947#factFINAL assume true; 1644942#factEXIT >#70#return; 1644941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644940#factFINAL assume true; 1644808#factEXIT >#76#return; 1644807#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1644759#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1644758#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1644757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1644756#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1643694#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1643695#$Ultimate##0 ~n := #in~n; 1644274#L25 assume !(~n <= 0); 1643509#L26 call #t~ret0 := fact(~n - 1);< 1644237#$Ultimate##0 ~n := #in~n; 1643605#L25 assume ~n <= 0;#res := 1; 1643606#factFINAL assume true; 1643501#factEXIT >#70#return; 1643513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644567#factFINAL assume true; 1644554#factEXIT >#72#return; 1643572#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1643496#$Ultimate##0 ~n := #in~n; 1643516#L25 assume !(~n <= 0); 1643503#L26 call #t~ret0 := fact(~n - 1);< 1643659#$Ultimate##0 ~n := #in~n; 1643605#L25 assume ~n <= 0;#res := 1; 1643606#factFINAL assume true; 1643501#factEXIT >#70#return; 1643511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1643706#factFINAL assume true; 1643704#factEXIT >#74#return; 1643705#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1643697#$Ultimate##0 ~n := #in~n; 1645655#L25 assume ~n <= 0;#res := 1; 1645656#factFINAL assume true; 1645875#factEXIT >#76#return; 1645873#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1645874#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1645879#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1645878#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1645877#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1645469#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1645678#$Ultimate##0 ~n := #in~n; 1645687#L25 assume !(~n <= 0); 1643580#L26 call #t~ret0 := fact(~n - 1);< 1643515#$Ultimate##0 ~n := #in~n; 1645450#L25 assume !(~n <= 0); 1643583#L26 call #t~ret0 := fact(~n - 1);< 1645452#$Ultimate##0 ~n := #in~n; 1645436#L25 assume ~n <= 0;#res := 1; 1645434#factFINAL assume true; 1645417#factEXIT >#70#return; 1645422#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1645560#factFINAL assume true; 1645552#factEXIT >#70#return; 1645555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1645743#factFINAL assume true; 1645744#factEXIT >#78#return; 1645669#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1645681#$Ultimate##0 ~n := #in~n; 1650750#L25 assume !(~n <= 0); 1646768#L26 call #t~ret0 := fact(~n - 1);< 1646841#$Ultimate##0 ~n := #in~n; 1646838#L25 assume ~n <= 0;#res := 1; 1646839#factFINAL assume true; 1646758#factEXIT >#70#return; 1646778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1651318#factFINAL assume true; 1651206#factEXIT >#80#return; 1651201#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1650785#$Ultimate##0 ~n := #in~n; 1651319#L25 assume !(~n <= 0); 1646759#L26 call #t~ret0 := fact(~n - 1);< 1646841#$Ultimate##0 ~n := #in~n; 1646838#L25 assume ~n <= 0;#res := 1; 1646839#factFINAL assume true; 1646758#factEXIT >#70#return; 1646774#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1651314#factFINAL assume true; 1651196#factEXIT >#82#return; 1651204#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1655376#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1655377#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1656631#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1656630#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1645968#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1646735#$Ultimate##0 ~n := #in~n; 1648837#L25 assume !(~n <= 0); 1646765#L26 call #t~ret0 := fact(~n - 1);< 1648139#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1646781#factFINAL assume true; 1646794#factEXIT >#70#return; 1647077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1651148#factFINAL assume true; 1651091#factEXIT >#78#return; 1646076#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1648369#$Ultimate##0 ~n := #in~n; 1648368#L25 assume !(~n <= 0); 1646767#L26 call #t~ret0 := fact(~n - 1);< 1647074#$Ultimate##0 ~n := #in~n; 1646838#L25 assume ~n <= 0;#res := 1; 1646839#factFINAL assume true; 1646758#factEXIT >#70#return; 1646775#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1649402#factFINAL assume true; 1645919#factEXIT >#80#return; 1646673#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1648364#$Ultimate##0 ~n := #in~n; 1648363#L25 assume !(~n <= 0); 1646857#L26 call #t~ret0 := fact(~n - 1);< 1647073#$Ultimate##0 ~n := #in~n; 1647067#L25 assume !(~n <= 0); 1646844#L26 call #t~ret0 := fact(~n - 1);< 1646866#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1649023#factFINAL assume true; 1648953#factEXIT >#82#return; 1648989#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1651179#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1651177#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1651174#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1651173#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1646176#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1646735#$Ultimate##0 ~n := #in~n; 1648837#L25 assume !(~n <= 0); 1646765#L26 call #t~ret0 := fact(~n - 1);< 1648139#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1646781#factFINAL assume true; 1646794#factEXIT >#70#return; 1647069#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1646976#factFINAL assume true; 1646846#factEXIT >#70#return; 1646757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1646736#factFINAL assume true; 1646756#factEXIT >#78#return; 1646161#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1646735#$Ultimate##0 ~n := #in~n; 1648837#L25 assume !(~n <= 0); 1646765#L26 call #t~ret0 := fact(~n - 1);< 1648139#$Ultimate##0 ~n := #in~n; 1646838#L25 assume ~n <= 0;#res := 1; 1646839#factFINAL assume true; 1646758#factEXIT >#70#return; 1646775#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1649402#factFINAL assume true; 1645919#factEXIT >#80#return; 1646702#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1648367#$Ultimate##0 ~n := #in~n; 1648366#L25 assume !(~n <= 0); 1646779#L26 call #t~ret0 := fact(~n - 1);< 1646780#$Ultimate##0 ~n := #in~n; 1648669#L25 assume !(~n <= 0); 1646843#L26 call #t~ret0 := fact(~n - 1);< 1646864#$Ultimate##0 ~n := #in~n; 1647067#L25 assume !(~n <= 0); 1646844#L26 call #t~ret0 := fact(~n - 1);< 1646866#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1646781#factFINAL assume true; 1646794#factEXIT >#70#return; 1647077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1651148#factFINAL assume true; 1651091#factEXIT >#82#return; 1651092#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1651169#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1651167#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1651165#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1638685#L42-4 [2023-11-29 01:20:35,556 INFO L750 eck$LassoCheckResult]: Loop: 1638685#L42-4 havoc main_~k~0#1; 1638641#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1638635#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1638636#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1645351#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1644918#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1644951#$Ultimate##0 ~n := #in~n; 1644933#L25 assume !(~n <= 0); 1644931#L26 call #t~ret0 := fact(~n - 1);< 1644932#$Ultimate##0 ~n := #in~n; 1644936#L25 assume !(~n <= 0); 1645067#L26 call #t~ret0 := fact(~n - 1);< 1645075#$Ultimate##0 ~n := #in~n; 1645083#L25 assume ~n <= 0;#res := 1; 1645086#factFINAL assume true; 1645082#factEXIT >#70#return; 1645079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1645074#factFINAL assume true; 1645066#factEXIT >#70#return; 1645060#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1645056#factFINAL assume true; 1645050#factEXIT >#72#return; 1644840#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1644911#$Ultimate##0 ~n := #in~n; 1644938#L25 assume ~n <= 0;#res := 1; 1644937#factFINAL assume true; 1644811#factEXIT >#74#return; 1644660#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1645041#$Ultimate##0 ~n := #in~n; 1645055#L25 assume !(~n <= 0); 1645046#L26 call #t~ret0 := fact(~n - 1);< 1645049#$Ultimate##0 ~n := #in~n; 1644949#L25 assume !(~n <= 0); 1645045#L26 call #t~ret0 := fact(~n - 1);< 1645063#$Ultimate##0 ~n := #in~n; 1645076#L25 assume ~n <= 0;#res := 1; 1645071#factFINAL assume true; 1645062#factEXIT >#70#return; 1645058#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1645051#factFINAL assume true; 1645044#factEXIT >#70#return; 1645043#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1645042#factFINAL assume true; 1645039#factEXIT >#76#return; 1645040#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1645336#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1645334#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1645331#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1645329#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1643786#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1643695#$Ultimate##0 ~n := #in~n; 1644274#L25 assume !(~n <= 0); 1643509#L26 call #t~ret0 := fact(~n - 1);< 1644237#$Ultimate##0 ~n := #in~n; 1644401#L25 assume !(~n <= 0); 1644230#L26 call #t~ret0 := fact(~n - 1);< 1644784#$Ultimate##0 ~n := #in~n; 1644283#L25 assume ~n <= 0;#res := 1; 1644281#factFINAL assume true; 1644277#factEXIT >#70#return; 1644275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644238#factFINAL assume true; 1644224#factEXIT >#70#return; 1644223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644222#factFINAL assume true; 1643707#factEXIT >#72#return; 1643574#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1643496#$Ultimate##0 ~n := #in~n; 1643516#L25 assume !(~n <= 0); 1643503#L26 call #t~ret0 := fact(~n - 1);< 1643659#$Ultimate##0 ~n := #in~n; 1643605#L25 assume ~n <= 0;#res := 1; 1643606#factFINAL assume true; 1643501#factEXIT >#70#return; 1643511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1643706#factFINAL assume true; 1643704#factEXIT >#74#return; 1643644#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1643698#$Ultimate##0 ~n := #in~n; 1644276#L25 assume !(~n <= 0); 1643502#L26 call #t~ret0 := fact(~n - 1);< 1643608#$Ultimate##0 ~n := #in~n; 1643605#L25 assume ~n <= 0;#res := 1; 1643606#factFINAL assume true; 1643501#factEXIT >#70#return; 1643510#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644631#factFINAL assume true; 1644622#factEXIT >#76#return; 1644627#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1645033#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1644994#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1644995#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1644585#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1643785#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1643695#$Ultimate##0 ~n := #in~n; 1644274#L25 assume !(~n <= 0); 1643509#L26 call #t~ret0 := fact(~n - 1);< 1644237#$Ultimate##0 ~n := #in~n; 1644401#L25 assume !(~n <= 0); 1644230#L26 call #t~ret0 := fact(~n - 1);< 1644784#$Ultimate##0 ~n := #in~n; 1644283#L25 assume ~n <= 0;#res := 1; 1644281#factFINAL assume true; 1644277#factEXIT >#70#return; 1644275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644238#factFINAL assume true; 1644224#factEXIT >#70#return; 1644223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1644222#factFINAL assume true; 1643707#factEXIT >#72#return; 1643524#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1638667#$Ultimate##0 ~n := #in~n; 1650538#L25 assume !(~n <= 0); 1650321#L26 call #t~ret0 := fact(~n - 1);< 1650443#$Ultimate##0 ~n := #in~n; 1650429#L25 assume ~n <= 0;#res := 1; 1650325#factFINAL assume true; 1650315#factEXIT >#70#return; 1650324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1650698#factFINAL assume true; 1650697#factEXIT >#74#return; 1650662#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1650683#$Ultimate##0 ~n := #in~n; 1652140#L25 assume ~n <= 0;#res := 1; 1652139#factFINAL assume true; 1651964#factEXIT >#76#return; 1651961#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1653813#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1653811#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1653809#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1653808#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1646572#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1646735#$Ultimate##0 ~n := #in~n; 1648837#L25 assume !(~n <= 0); 1646765#L26 call #t~ret0 := fact(~n - 1);< 1648139#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1646781#factFINAL assume true; 1646794#factEXIT >#70#return; 1647077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1651148#factFINAL assume true; 1651091#factEXIT >#78#return; 1646603#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1648369#$Ultimate##0 ~n := #in~n; 1648368#L25 assume !(~n <= 0); 1646767#L26 call #t~ret0 := fact(~n - 1);< 1647074#$Ultimate##0 ~n := #in~n; 1647067#L25 assume !(~n <= 0); 1646844#L26 call #t~ret0 := fact(~n - 1);< 1646866#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1649023#factFINAL assume true; 1648953#factEXIT >#80#return; 1646610#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1648369#$Ultimate##0 ~n := #in~n; 1648368#L25 assume !(~n <= 0); 1646767#L26 call #t~ret0 := fact(~n - 1);< 1647074#$Ultimate##0 ~n := #in~n; 1647067#L25 assume !(~n <= 0); 1646844#L26 call #t~ret0 := fact(~n - 1);< 1646866#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1649023#factFINAL assume true; 1648953#factEXIT >#82#return; 1649009#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1653806#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1653801#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1653796#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1653791#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1646620#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1646735#$Ultimate##0 ~n := #in~n; 1648837#L25 assume !(~n <= 0); 1646765#L26 call #t~ret0 := fact(~n - 1);< 1648139#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647076#L25 assume !(~n <= 0); 1646787#L26 call #t~ret0 := fact(~n - 1);< 1647075#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1646781#factFINAL assume true; 1646794#factEXIT >#70#return; 1647077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1651148#factFINAL assume true; 1651091#factEXIT >#78#return; 1646192#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1648369#$Ultimate##0 ~n := #in~n; 1648368#L25 assume !(~n <= 0); 1646767#L26 call #t~ret0 := fact(~n - 1);< 1647074#$Ultimate##0 ~n := #in~n; 1646838#L25 assume ~n <= 0;#res := 1; 1646839#factFINAL assume true; 1646758#factEXIT >#70#return; 1646775#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1649402#factFINAL assume true; 1645919#factEXIT >#80#return; 1646653#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1648364#$Ultimate##0 ~n := #in~n; 1648363#L25 assume !(~n <= 0); 1646857#L26 call #t~ret0 := fact(~n - 1);< 1647073#$Ultimate##0 ~n := #in~n; 1647067#L25 assume !(~n <= 0); 1646844#L26 call #t~ret0 := fact(~n - 1);< 1646866#$Ultimate##0 ~n := #in~n; 1647068#L25 assume ~n <= 0;#res := 1; 1646869#factFINAL assume true; 1646842#factEXIT >#70#return; 1646845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1647084#factFINAL assume true; 1646856#factEXIT >#70#return; 1646859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1649023#factFINAL assume true; 1648953#factEXIT >#82#return; 1648960#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1656616#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1656613#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1656610#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1638685#L42-4 [2023-11-29 01:20:35,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1867467624, now seen corresponding path program 24 times [2023-11-29 01:20:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159175775] [2023-11-29 01:20:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:35,600 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323642845] [2023-11-29 01:20:35,600 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:20:35,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:35,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:35,602 INFO L229 MonitoredProcess]: Starting monitored process 585 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:35,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (585)] Waiting until timeout for monitored process [2023-11-29 01:20:38,543 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2023-11-29 01:20:38,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:20:38,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:20:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:20:39,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:20:39,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 971580292, now seen corresponding path program 18 times [2023-11-29 01:20:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835339708] [2023-11-29 01:20:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:39,223 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83958936] [2023-11-29 01:20:39,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:20:39,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:39,225 INFO L229 MonitoredProcess]: Starting monitored process 586 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:39,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (586)] Waiting until timeout for monitored process [2023-11-29 01:20:40,986 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-11-29 01:20:40,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:40,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 01:20:40,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 2116 proven. 43 refuted. 0 times theorem prover too weak. 1412 trivial. 0 not checked. [2023-11-29 01:20:41,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 396 proven. 353 refuted. 0 times theorem prover too weak. 2822 trivial. 0 not checked. [2023-11-29 01:20:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835339708] [2023-11-29 01:20:41,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83958936] [2023-11-29 01:20:41,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83958936] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:41,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 19 [2023-11-29 01:20:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449898600] [2023-11-29 01:20:41,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:41,613 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:20:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:20:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:20:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:20:41,614 INFO L87 Difference]: Start difference. First operand 18754 states and 62041 transitions. cyclomatic complexity: 43379 Second operand has 19 states, 16 states have (on average 3.5) internal successors, (56), 19 states have internal predecessors, (56), 12 states have call successors, (23), 2 states have call predecessors, (23), 7 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-29 01:20:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:42,443 INFO L93 Difference]: Finished difference Result 23019 states and 80213 transitions. [2023-11-29 01:20:42,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23019 states and 80213 transitions. [2023-11-29 01:20:42,760 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 6033 [2023-11-29 01:20:43,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23019 states to 22946 states and 80109 transitions. [2023-11-29 01:20:43,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7700 [2023-11-29 01:20:43,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7700 [2023-11-29 01:20:43,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22946 states and 80109 transitions. [2023-11-29 01:20:43,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:20:43,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22946 states and 80109 transitions. [2023-11-29 01:20:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22946 states and 80109 transitions. [2023-11-29 01:20:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22946 to 18579. [2023-11-29 01:20:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18579 states, 9790 states have (on average 1.032073544433095) internal successors, (10104), 9711 states have internal predecessors, (10104), 7078 states have call successors, (7776), 1800 states have call predecessors, (7776), 1711 states have return successors, (43701), 7067 states have call predecessors, (43701), 7078 states have call successors, (43701) [2023-11-29 01:20:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18579 states to 18579 states and 61581 transitions. [2023-11-29 01:20:44,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18579 states and 61581 transitions. [2023-11-29 01:20:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:20:44,565 INFO L428 stractBuchiCegarLoop]: Abstraction has 18579 states and 61581 transitions. [2023-11-29 01:20:44,565 INFO L335 stractBuchiCegarLoop]: ======== Iteration 63 ============ [2023-11-29 01:20:44,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18579 states and 61581 transitions. [2023-11-29 01:20:44,679 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 4399 [2023-11-29 01:20:44,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:20:44,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:20:44,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [72, 72, 42, 42, 42, 42, 30, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:44,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [39, 39, 24, 24, 24, 24, 15, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 01:20:44,683 INFO L748 eck$LassoCheckResult]: Stem: 1681850#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1681796#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1681797#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1681815#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1681851#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1682301#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1682300#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1682298#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1682299#$Ultimate##0 ~n := #in~n; 1682305#L25 assume ~n <= 0;#res := 1; 1682304#factFINAL assume true; 1682297#factEXIT >#72#return; 1682293#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1682294#$Ultimate##0 ~n := #in~n; 1682307#L25 assume ~n <= 0;#res := 1; 1682306#factFINAL assume true; 1682292#factEXIT >#74#return; 1682290#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1682291#$Ultimate##0 ~n := #in~n; 1682322#L25 assume ~n <= 0;#res := 1; 1682321#factFINAL assume true; 1682289#factEXIT >#76#return; 1682288#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1682285#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1682282#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1682281#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1682177#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1682175#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1682176#$Ultimate##0 ~n := #in~n; 1682187#L25 assume !(~n <= 0); 1682184#L26 call #t~ret0 := fact(~n - 1);< 1682185#$Ultimate##0 ~n := #in~n; 1682208#L25 assume ~n <= 0;#res := 1; 1682207#factFINAL assume true; 1682183#factEXIT >#70#return; 1682181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682179#factFINAL assume true; 1682174#factEXIT >#78#return; 1682167#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1682168#$Ultimate##0 ~n := #in~n; 1682273#L25 assume ~n <= 0;#res := 1; 1682270#factFINAL assume true; 1682166#factEXIT >#80#return; 1682159#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1682160#$Ultimate##0 ~n := #in~n; 1682739#L25 assume !(~n <= 0); 1682735#L26 call #t~ret0 := fact(~n - 1);< 1682737#$Ultimate##0 ~n := #in~n; 1682997#L25 assume ~n <= 0;#res := 1; 1682740#factFINAL assume true; 1682734#factEXIT >#70#return; 1682733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682732#factFINAL assume true; 1682158#factEXIT >#82#return; 1682156#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1682154#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1682152#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1682150#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1682148#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1682076#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1682081#$Ultimate##0 ~n := #in~n; 1682109#L25 assume !(~n <= 0); 1682103#L26 call #t~ret0 := fact(~n - 1);< 1682106#$Ultimate##0 ~n := #in~n; 1682114#L25 assume !(~n <= 0); 1682101#L26 call #t~ret0 := fact(~n - 1);< 1682112#$Ultimate##0 ~n := #in~n; 1682115#L25 assume ~n <= 0;#res := 1; 1682113#factFINAL assume true; 1682111#factEXIT >#70#return; 1682110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682107#factFINAL assume true; 1682099#factEXIT >#70#return; 1682097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682095#factFINAL assume true; 1682075#factEXIT >#78#return; 1682080#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1682145#$Ultimate##0 ~n := #in~n; 1682204#L25 assume ~n <= 0;#res := 1; 1682203#factFINAL assume true; 1682144#factEXIT >#80#return; 1682140#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1682143#$Ultimate##0 ~n := #in~n; 1682302#L25 assume !(~n <= 0); 1682196#L26 call #t~ret0 := fact(~n - 1);< 1682202#$Ultimate##0 ~n := #in~n; 1682357#L25 assume !(~n <= 0); 1682200#L26 call #t~ret0 := fact(~n - 1);< 1682353#$Ultimate##0 ~n := #in~n; 1682358#L25 assume ~n <= 0;#res := 1; 1682355#factFINAL assume true; 1682352#factEXIT >#70#return; 1682350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682349#factFINAL assume true; 1682347#factEXIT >#70#return; 1682348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682360#factFINAL assume true; 1682359#factEXIT >#82#return; 1682142#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1682354#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1682351#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1682343#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1682328#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1682126#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1682129#$Ultimate##0 ~n := #in~n; 1682346#L25 assume !(~n <= 0); 1682198#L26 call #t~ret0 := fact(~n - 1);< 1682202#$Ultimate##0 ~n := #in~n; 1682357#L25 assume !(~n <= 0); 1682200#L26 call #t~ret0 := fact(~n - 1);< 1682353#$Ultimate##0 ~n := #in~n; 1682357#L25 assume !(~n <= 0); 1682200#L26 call #t~ret0 := fact(~n - 1);< 1682353#$Ultimate##0 ~n := #in~n; 1682358#L25 assume ~n <= 0;#res := 1; 1682355#factFINAL assume true; 1682352#factEXIT >#70#return; 1682350#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682349#factFINAL assume true; 1682347#factEXIT >#70#return; 1682345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682344#factFINAL assume true; 1682329#factEXIT >#70#return; 1682327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682132#factFINAL assume true; 1682124#factEXIT >#78#return; 1682128#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1682256#$Ultimate##0 ~n := #in~n; 1682260#L25 assume ~n <= 0;#res := 1; 1682258#factFINAL assume true; 1682255#factEXIT >#80#return; 1682253#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1682254#$Ultimate##0 ~n := #in~n; 1682262#L25 assume !(~n <= 0); 1682234#L26 call #t~ret0 := fact(~n - 1);< 1682261#$Ultimate##0 ~n := #in~n; 1682287#L25 assume !(~n <= 0); 1682233#L26 call #t~ret0 := fact(~n - 1);< 1682240#$Ultimate##0 ~n := #in~n; 1682284#L25 assume !(~n <= 0); 1682236#L26 call #t~ret0 := fact(~n - 1);< 1682280#$Ultimate##0 ~n := #in~n; 1682286#L25 assume ~n <= 0;#res := 1; 1682283#factFINAL assume true; 1682279#factEXIT >#70#return; 1682278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682277#factFINAL assume true; 1682275#factEXIT >#70#return; 1682274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682271#factFINAL assume true; 1682232#factEXIT >#70#return; 1682238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682259#factFINAL assume true; 1682252#factEXIT >#82#return; 1682251#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1682250#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1682249#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1682247#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1682244#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1682213#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1682215#$Ultimate##0 ~n := #in~n; 1682265#L25 assume !(~n <= 0); 1682235#L26 call #t~ret0 := fact(~n - 1);< 1682240#$Ultimate##0 ~n := #in~n; 1682284#L25 assume !(~n <= 0); 1682236#L26 call #t~ret0 := fact(~n - 1);< 1682280#$Ultimate##0 ~n := #in~n; 1682284#L25 assume !(~n <= 0); 1682236#L26 call #t~ret0 := fact(~n - 1);< 1682280#$Ultimate##0 ~n := #in~n; 1682284#L25 assume !(~n <= 0); 1682236#L26 call #t~ret0 := fact(~n - 1);< 1682280#$Ultimate##0 ~n := #in~n; 1682286#L25 assume ~n <= 0;#res := 1; 1682283#factFINAL assume true; 1682279#factEXIT >#70#return; 1682278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682277#factFINAL assume true; 1682275#factEXIT >#70#return; 1682274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682271#factFINAL assume true; 1682232#factEXIT >#70#return; 1682239#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682266#factFINAL assume true; 1682264#factEXIT >#70#return; 1682263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1682242#factFINAL assume true; 1682212#factEXIT >#78#return; 1682170#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1682172#$Ultimate##0 ~n := #in~n; 1684127#L25 assume ~n <= 0;#res := 1; 1684126#factFINAL assume true; 1684123#factEXIT >#80#return; 1684109#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1684120#$Ultimate##0 ~n := #in~n; 1684118#L25 assume !(~n <= 0); 1683019#L26 call #t~ret0 := fact(~n - 1);< 1684098#$Ultimate##0 ~n := #in~n; 1684141#L25 assume !(~n <= 0); 1683011#L26 call #t~ret0 := fact(~n - 1);< 1684129#$Ultimate##0 ~n := #in~n; 1684128#L25 assume !(~n <= 0); 1683025#L26 call #t~ret0 := fact(~n - 1);< 1683103#$Ultimate##0 ~n := #in~n; 1684135#L25 assume !(~n <= 0); 1683029#L26 call #t~ret0 := fact(~n - 1);< 1684125#$Ultimate##0 ~n := #in~n; 1684133#L25 assume ~n <= 0;#res := 1; 1684131#factFINAL assume true; 1684124#factEXIT >#70#return; 1684122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1684121#factFINAL assume true; 1684119#factEXIT >#70#return; 1684117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1684115#factFINAL assume true; 1684112#factEXIT >#70#return; 1684110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1684108#factFINAL assume true; 1684102#factEXIT >#70#return; 1684104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687798#factFINAL assume true; 1687784#factEXIT >#82#return; 1683650#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1687775#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1687772#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1687770#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1681858#L42-4 havoc main_~k~0#1; 1687765#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1687762#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1687760#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1687756#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1687590#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1687694#$Ultimate##0 ~n := #in~n; 1687742#L25 assume !(~n <= 0); 1687726#L26 call #t~ret0 := fact(~n - 1);< 1687729#$Ultimate##0 ~n := #in~n; 1687737#L25 assume ~n <= 0;#res := 1; 1687826#factFINAL assume true; 1687823#factEXIT >#70#return; 1687818#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687813#factFINAL assume true; 1687809#factEXIT >#72#return; 1687625#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1687691#$Ultimate##0 ~n := #in~n; 1687714#L25 assume ~n <= 0;#res := 1; 1687693#factFINAL assume true; 1687581#factEXIT >#74#return; 1687676#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1687805#$Ultimate##0 ~n := #in~n; 1687819#L25 assume !(~n <= 0); 1687711#L26 call #t~ret0 := fact(~n - 1);< 1687815#$Ultimate##0 ~n := #in~n; 1687822#L25 assume ~n <= 0;#res := 1; 1687817#factFINAL assume true; 1687814#factEXIT >#70#return; 1687810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687807#factFINAL assume true; 1687804#factEXIT >#76#return; 1687802#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1687801#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1687800#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1687799#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1687795#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1686824#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1686825#$Ultimate##0 ~n := #in~n; 1687386#L25 assume !(~n <= 0); 1686713#L26 call #t~ret0 := fact(~n - 1);< 1687348#$Ultimate##0 ~n := #in~n; 1686707#L25 assume ~n <= 0;#res := 1; 1686716#factFINAL assume true; 1686836#factEXIT >#70#return; 1686839#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1688006#factFINAL assume true; 1687909#factEXIT >#72#return; 1686767#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1686820#$Ultimate##0 ~n := #in~n; 1686819#L25 assume !(~n <= 0); 1686709#L26 call #t~ret0 := fact(~n - 1);< 1686818#$Ultimate##0 ~n := #in~n; 1686707#L25 assume ~n <= 0;#res := 1; 1686716#factFINAL assume true; 1686836#factEXIT >#70#return; 1686835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1686834#factFINAL assume true; 1686830#factEXIT >#74#return; 1686831#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1686829#$Ultimate##0 ~n := #in~n; 1686844#L25 assume ~n <= 0;#res := 1; 1686843#factFINAL assume true; 1686840#factEXIT >#76#return; 1686841#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1692780#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1692779#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1692778#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1692775#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1688341#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1688338#$Ultimate##0 ~n := #in~n; 1688359#L25 assume !(~n <= 0); 1686682#L26 call #t~ret0 := fact(~n - 1);< 1686691#$Ultimate##0 ~n := #in~n; 1688228#L25 assume !(~n <= 0); 1686675#L26 call #t~ret0 := fact(~n - 1);< 1688589#$Ultimate##0 ~n := #in~n; 1688213#L25 assume ~n <= 0;#res := 1; 1688211#factFINAL assume true; 1688195#factEXIT >#70#return; 1688200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1688374#factFINAL assume true; 1688368#factEXIT >#70#return; 1688369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1688404#factFINAL assume true; 1688405#factEXIT >#78#return; 1688440#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1688447#$Ultimate##0 ~n := #in~n; 1692730#L25 assume !(~n <= 0); 1689830#L26 call #t~ret0 := fact(~n - 1);< 1689926#$Ultimate##0 ~n := #in~n; 1689906#L25 assume ~n <= 0;#res := 1; 1689840#factFINAL assume true; 1689818#factEXIT >#70#return; 1689837#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692773#factFINAL assume true; 1692772#factEXIT >#80#return; 1692762#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1681853#$Ultimate##0 ~n := #in~n; 1692774#L25 assume !(~n <= 0); 1689825#L26 call #t~ret0 := fact(~n - 1);< 1689926#$Ultimate##0 ~n := #in~n; 1689906#L25 assume ~n <= 0;#res := 1; 1689840#factFINAL assume true; 1689818#factEXIT >#70#return; 1689835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692771#factFINAL assume true; 1692761#factEXIT >#82#return; 1692759#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1692758#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1692757#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1692756#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1692755#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1689596#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1689816#$Ultimate##0 ~n := #in~n; 1690664#L25 assume !(~n <= 0); 1689832#L26 call #t~ret0 := fact(~n - 1);< 1690708#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689956#factFINAL assume true; 1689957#factEXIT >#70#return; 1690195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692487#factFINAL assume true; 1692483#factEXIT >#78#return; 1689026#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1690341#$Ultimate##0 ~n := #in~n; 1690298#L25 assume !(~n <= 0); 1689819#L26 call #t~ret0 := fact(~n - 1);< 1690192#$Ultimate##0 ~n := #in~n; 1689906#L25 assume ~n <= 0;#res := 1; 1689840#factFINAL assume true; 1689818#factEXIT >#70#return; 1689817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689815#factFINAL assume true; 1688996#factEXIT >#80#return; 1689724#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1692030#$Ultimate##0 ~n := #in~n; 1691981#L25 assume !(~n <= 0); 1689937#L26 call #t~ret0 := fact(~n - 1);< 1689958#$Ultimate##0 ~n := #in~n; 1690187#L25 assume !(~n <= 0); 1689928#L26 call #t~ret0 := fact(~n - 1);< 1689952#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690663#factFINAL assume true; 1690487#factEXIT >#82#return; 1690513#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1692495#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1692494#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1692493#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1692492#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1689243#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1689816#$Ultimate##0 ~n := #in~n; 1690664#L25 assume !(~n <= 0); 1689832#L26 call #t~ret0 := fact(~n - 1);< 1690708#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689956#factFINAL assume true; 1689957#factEXIT >#70#return; 1690189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689999#factFINAL assume true; 1689945#factEXIT >#70#return; 1689946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692501#factFINAL assume true; 1690719#factEXIT >#78#return; 1689241#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1689816#$Ultimate##0 ~n := #in~n; 1690664#L25 assume !(~n <= 0); 1689832#L26 call #t~ret0 := fact(~n - 1);< 1690708#$Ultimate##0 ~n := #in~n; 1689906#L25 assume ~n <= 0;#res := 1; 1689840#factFINAL assume true; 1689818#factEXIT >#70#return; 1689817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689815#factFINAL assume true; 1688996#factEXIT >#80#return; 1689789#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1690477#$Ultimate##0 ~n := #in~n; 1690475#L25 assume !(~n <= 0); 1689938#L26 call #t~ret0 := fact(~n - 1);< 1690297#$Ultimate##0 ~n := #in~n; 1690202#L25 assume !(~n <= 0); 1689929#L26 call #t~ret0 := fact(~n - 1);< 1689951#$Ultimate##0 ~n := #in~n; 1690187#L25 assume !(~n <= 0); 1689928#L26 call #t~ret0 := fact(~n - 1);< 1689952#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689956#factFINAL assume true; 1689957#factEXIT >#70#return; 1690195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692487#factFINAL assume true; 1692483#factEXIT >#82#return; 1692485#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1692491#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1692490#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1692489#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1688024#L42-4 [2023-11-29 01:20:44,683 INFO L750 eck$LassoCheckResult]: Loop: 1688024#L42-4 havoc main_~k~0#1; 1688023#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1688022#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1688021#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1688020#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1687700#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1687706#$Ultimate##0 ~n := #in~n; 1687741#L25 assume !(~n <= 0); 1687726#L26 call #t~ret0 := fact(~n - 1);< 1687729#$Ultimate##0 ~n := #in~n; 1687735#L25 assume !(~n <= 0); 1687727#L26 call #t~ret0 := fact(~n - 1);< 1687734#$Ultimate##0 ~n := #in~n; 1687738#L25 assume ~n <= 0;#res := 1; 1687740#factFINAL assume true; 1687739#factEXIT >#70#return; 1687736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687733#factFINAL assume true; 1687725#factEXIT >#70#return; 1687722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687715#factFINAL assume true; 1687695#factEXIT >#72#return; 1687623#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1687691#$Ultimate##0 ~n := #in~n; 1687714#L25 assume ~n <= 0;#res := 1; 1687693#factFINAL assume true; 1687581#factEXIT >#74#return; 1687566#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1687579#$Ultimate##0 ~n := #in~n; 1687721#L25 assume !(~n <= 0); 1687710#L26 call #t~ret0 := fact(~n - 1);< 1687713#$Ultimate##0 ~n := #in~n; 1687751#L25 assume !(~n <= 0); 1687708#L26 call #t~ret0 := fact(~n - 1);< 1687732#$Ultimate##0 ~n := #in~n; 1687750#L25 assume ~n <= 0;#res := 1; 1687748#factFINAL assume true; 1687731#factEXIT >#70#return; 1687724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687717#factFINAL assume true; 1687707#factEXIT >#70#return; 1687692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687580#factFINAL assume true; 1687559#factEXIT >#76#return; 1687575#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1688019#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1688018#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1688017#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1688016#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1686861#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1686825#$Ultimate##0 ~n := #in~n; 1687386#L25 assume !(~n <= 0); 1686713#L26 call #t~ret0 := fact(~n - 1);< 1687348#$Ultimate##0 ~n := #in~n; 1687876#L25 assume !(~n <= 0); 1687340#L26 call #t~ret0 := fact(~n - 1);< 1688029#$Ultimate##0 ~n := #in~n; 1687432#L25 assume ~n <= 0;#res := 1; 1687429#factFINAL assume true; 1687390#factEXIT >#70#return; 1687388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687350#factFINAL assume true; 1687335#factEXIT >#70#return; 1687333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1687331#factFINAL assume true; 1686846#factEXIT >#72#return; 1686792#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1686820#$Ultimate##0 ~n := #in~n; 1686819#L25 assume !(~n <= 0); 1686709#L26 call #t~ret0 := fact(~n - 1);< 1686818#$Ultimate##0 ~n := #in~n; 1686707#L25 assume ~n <= 0;#res := 1; 1686716#factFINAL assume true; 1686836#factEXIT >#70#return; 1686835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1686834#factFINAL assume true; 1686830#factEXIT >#74#return; 1686762#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1688015#$Ultimate##0 ~n := #in~n; 1688507#L25 assume !(~n <= 0); 1686845#L26 call #t~ret0 := fact(~n - 1);< 1688430#$Ultimate##0 ~n := #in~n; 1688437#L25 assume ~n <= 0;#res := 1; 1688425#factFINAL assume true; 1688417#factEXIT >#70#return; 1688421#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1688485#factFINAL assume true; 1688480#factEXIT >#76#return; 1688483#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1688660#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1688659#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1688657#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1688655#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1686468#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1686670#$Ultimate##0 ~n := #in~n; 1686699#L25 assume !(~n <= 0); 1686680#L26 call #t~ret0 := fact(~n - 1);< 1686691#$Ultimate##0 ~n := #in~n; 1688228#L25 assume !(~n <= 0); 1686675#L26 call #t~ret0 := fact(~n - 1);< 1688589#$Ultimate##0 ~n := #in~n; 1688213#L25 assume ~n <= 0;#res := 1; 1688211#factFINAL assume true; 1688195#factEXIT >#70#return; 1688200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1688374#factFINAL assume true; 1688368#factEXIT >#70#return; 1688373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1688455#factFINAL assume true; 1688451#factEXIT >#72#return; 1686696#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1681838#$Ultimate##0 ~n := #in~n; 1692655#L25 assume !(~n <= 0); 1689820#L26 call #t~ret0 := fact(~n - 1);< 1690192#$Ultimate##0 ~n := #in~n; 1690187#L25 assume !(~n <= 0); 1689928#L26 call #t~ret0 := fact(~n - 1);< 1689952#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692748#factFINAL assume true; 1692747#factEXIT >#74#return; 1692737#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1681779#$Ultimate##0 ~n := #in~n; 1692746#L25 assume ~n <= 0;#res := 1; 1692745#factFINAL assume true; 1692731#factEXIT >#76#return; 1692743#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1697290#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1697289#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1697287#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1697285#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1689448#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1689816#$Ultimate##0 ~n := #in~n; 1690664#L25 assume !(~n <= 0); 1689832#L26 call #t~ret0 := fact(~n - 1);< 1690708#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689956#factFINAL assume true; 1689957#factEXIT >#70#return; 1690195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692487#factFINAL assume true; 1692483#factEXIT >#78#return; 1689473#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1690341#$Ultimate##0 ~n := #in~n; 1690298#L25 assume !(~n <= 0); 1689819#L26 call #t~ret0 := fact(~n - 1);< 1690192#$Ultimate##0 ~n := #in~n; 1689906#L25 assume ~n <= 0;#res := 1; 1689840#factFINAL assume true; 1689818#factEXIT >#70#return; 1689817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689815#factFINAL assume true; 1688996#factEXIT >#80#return; 1689737#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1692030#$Ultimate##0 ~n := #in~n; 1691981#L25 assume !(~n <= 0); 1689937#L26 call #t~ret0 := fact(~n - 1);< 1689958#$Ultimate##0 ~n := #in~n; 1690187#L25 assume !(~n <= 0); 1689928#L26 call #t~ret0 := fact(~n - 1);< 1689952#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690663#factFINAL assume true; 1690487#factEXIT >#82#return; 1690625#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1699444#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1699443#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1699442#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1699441#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1689594#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1689816#$Ultimate##0 ~n := #in~n; 1690664#L25 assume !(~n <= 0); 1689832#L26 call #t~ret0 := fact(~n - 1);< 1690708#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690194#L25 assume !(~n <= 0); 1689923#L26 call #t~ret0 := fact(~n - 1);< 1690193#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689956#factFINAL assume true; 1689957#factEXIT >#70#return; 1690195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1692487#factFINAL assume true; 1692483#factEXIT >#78#return; 1689010#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1690341#$Ultimate##0 ~n := #in~n; 1690298#L25 assume !(~n <= 0); 1689819#L26 call #t~ret0 := fact(~n - 1);< 1690192#$Ultimate##0 ~n := #in~n; 1689906#L25 assume ~n <= 0;#res := 1; 1689840#factFINAL assume true; 1689818#factEXIT >#70#return; 1689817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1689815#factFINAL assume true; 1688996#factEXIT >#80#return; 1689712#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1692030#$Ultimate##0 ~n := #in~n; 1691981#L25 assume !(~n <= 0); 1689937#L26 call #t~ret0 := fact(~n - 1);< 1689958#$Ultimate##0 ~n := #in~n; 1690187#L25 assume !(~n <= 0); 1689928#L26 call #t~ret0 := fact(~n - 1);< 1689952#$Ultimate##0 ~n := #in~n; 1690188#L25 assume ~n <= 0;#res := 1; 1689955#factFINAL assume true; 1689927#factEXIT >#70#return; 1689931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690203#factFINAL assume true; 1689932#factEXIT >#70#return; 1689939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1690663#factFINAL assume true; 1690487#factEXIT >#82#return; 1690564#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1699833#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1699832#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1699831#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1688024#L42-4 [2023-11-29 01:20:44,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1867467624, now seen corresponding path program 25 times [2023-11-29 01:20:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:44,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062160198] [2023-11-29 01:20:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:44,727 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578052554] [2023-11-29 01:20:44,727 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:20:44,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:44,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:44,729 INFO L229 MonitoredProcess]: Starting monitored process 587 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:44,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (587)] Waiting until timeout for monitored process [2023-11-29 01:20:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:20:46,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:20:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:20:47,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:20:47,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash -355950780, now seen corresponding path program 19 times [2023-11-29 01:20:47,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376788283] [2023-11-29 01:20:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:47,767 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956783946] [2023-11-29 01:20:47,767 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:20:47,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:47,770 INFO L229 MonitoredProcess]: Starting monitored process 588 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:47,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (588)] Waiting until timeout for monitored process [2023-11-29 01:20:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:49,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:20:49,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 1749 proven. 207 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2023-11-29 01:20:49,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3571 backedges. 199 proven. 399 refuted. 0 times theorem prover too weak. 2973 trivial. 0 not checked. [2023-11-29 01:20:50,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:20:50,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376788283] [2023-11-29 01:20:50,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:20:50,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956783946] [2023-11-29 01:20:50,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956783946] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:20:50,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:20:50,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2023-11-29 01:20:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521640278] [2023-11-29 01:20:50,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:20:50,179 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 01:20:50,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:20:50,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 01:20:50,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:20:50,180 INFO L87 Difference]: Start difference. First operand 18579 states and 61581 transitions. cyclomatic complexity: 43094 Second operand has 16 states, 13 states have (on average 3.769230769230769) internal successors, (49), 16 states have internal predecessors, (49), 11 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (20), 7 states have call predecessors, (20), 11 states have call successors, (20) [2023-11-29 01:20:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:50,794 INFO L93 Difference]: Finished difference Result 18567 states and 60341 transitions. [2023-11-29 01:20:50,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18567 states and 60341 transitions. [2023-11-29 01:20:51,035 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1779 [2023-11-29 01:20:51,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18567 states to 18469 states and 60128 transitions. [2023-11-29 01:20:51,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5631 [2023-11-29 01:20:51,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5637 [2023-11-29 01:20:51,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18469 states and 60128 transitions. [2023-11-29 01:20:51,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:20:51,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18469 states and 60128 transitions. [2023-11-29 01:20:51,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states and 60128 transitions. [2023-11-29 01:20:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 17902. [2023-11-29 01:20:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17902 states, 9492 states have (on average 1.0286557100716394) internal successors, (9764), 9424 states have internal predecessors, (9764), 6706 states have call successors, (7396), 1791 states have call predecessors, (7396), 1704 states have return successors, (41461), 6686 states have call predecessors, (41461), 6706 states have call successors, (41461) [2023-11-29 01:20:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17902 states to 17902 states and 58621 transitions. [2023-11-29 01:20:52,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17902 states and 58621 transitions. [2023-11-29 01:20:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:20:52,512 INFO L428 stractBuchiCegarLoop]: Abstraction has 17902 states and 58621 transitions. [2023-11-29 01:20:52,513 INFO L335 stractBuchiCegarLoop]: ======== Iteration 64 ============ [2023-11-29 01:20:52,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17902 states and 58621 transitions. [2023-11-29 01:20:52,741 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1705 [2023-11-29 01:20:52,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:20:52,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:20:52,743 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [142, 142, 109, 109, 109, 109, 33, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:52,743 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [45, 45, 42, 42, 42, 42, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:52,744 INFO L748 eck$LassoCheckResult]: Stem: 1721215#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1721145#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1721146#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1721184#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1721216#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1721713#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1726317#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1726295#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1726296#$Ultimate##0 ~n := #in~n; 1726316#L25 assume ~n <= 0;#res := 1; 1726315#factFINAL assume true; 1726294#factEXIT >#72#return; 1725793#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1725794#$Ultimate##0 ~n := #in~n; 1725799#L25 assume ~n <= 0;#res := 1; 1725798#factFINAL assume true; 1725792#factEXIT >#74#return; 1725728#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1725729#$Ultimate##0 ~n := #in~n; 1725791#L25 assume ~n <= 0;#res := 1; 1725748#factFINAL assume true; 1725727#factEXIT >#76#return; 1725724#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1725725#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1729526#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1729524#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1729523#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1729521#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1729522#$Ultimate##0 ~n := #in~n; 1729531#L25 assume !(~n <= 0); 1729529#L26 call #t~ret0 := fact(~n - 1);< 1729530#$Ultimate##0 ~n := #in~n; 1729533#L25 assume ~n <= 0;#res := 1; 1729532#factFINAL assume true; 1729528#factEXIT >#70#return; 1729527#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729525#factFINAL assume true; 1729520#factEXIT >#78#return; 1729518#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1729519#$Ultimate##0 ~n := #in~n; 1729535#L25 assume ~n <= 0;#res := 1; 1729534#factFINAL assume true; 1729517#factEXIT >#80#return; 1729514#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1729515#$Ultimate##0 ~n := #in~n; 1729554#L25 assume !(~n <= 0); 1729548#L26 call #t~ret0 := fact(~n - 1);< 1729550#$Ultimate##0 ~n := #in~n; 1731130#L25 assume ~n <= 0;#res := 1; 1731131#factFINAL assume true; 1729547#factEXIT >#70#return; 1729544#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729537#factFINAL assume true; 1729513#factEXIT >#82#return; 1729512#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1729511#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1729510#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1729508#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1729506#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1729503#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1729504#$Ultimate##0 ~n := #in~n; 1730085#L25 assume !(~n <= 0); 1721176#L26 call #t~ret0 := fact(~n - 1);< 1730084#$Ultimate##0 ~n := #in~n; 1737437#L25 assume !(~n <= 0); 1721175#L26 call #t~ret0 := fact(~n - 1);< 1721177#$Ultimate##0 ~n := #in~n; 1738073#L25 assume ~n <= 0;#res := 1; 1738071#factFINAL assume true; 1738068#factEXIT >#70#return; 1721193#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1721194#factFINAL assume true; 1730083#factEXIT >#70#return; 1730081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1730080#factFINAL assume true; 1729502#factEXIT >#78#return; 1729309#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1729310#$Ultimate##0 ~n := #in~n; 1729313#L25 assume ~n <= 0;#res := 1; 1729311#factFINAL assume true; 1729308#factEXIT >#80#return; 1729306#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1729307#$Ultimate##0 ~n := #in~n; 1729322#L25 assume !(~n <= 0); 1729319#L26 call #t~ret0 := fact(~n - 1);< 1729321#$Ultimate##0 ~n := #in~n; 1729457#L25 assume !(~n <= 0); 1729318#L26 call #t~ret0 := fact(~n - 1);< 1729454#$Ultimate##0 ~n := #in~n; 1729460#L25 assume ~n <= 0;#res := 1; 1729459#factFINAL assume true; 1729453#factEXIT >#70#return; 1729452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729451#factFINAL assume true; 1729315#factEXIT >#70#return; 1729314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729312#factFINAL assume true; 1729305#factEXIT >#82#return; 1729304#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1729300#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1729296#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1729294#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1729292#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1729284#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1729287#$Ultimate##0 ~n := #in~n; 1729335#L25 assume !(~n <= 0); 1729317#L26 call #t~ret0 := fact(~n - 1);< 1729321#$Ultimate##0 ~n := #in~n; 1729457#L25 assume !(~n <= 0); 1729318#L26 call #t~ret0 := fact(~n - 1);< 1729454#$Ultimate##0 ~n := #in~n; 1729457#L25 assume !(~n <= 0); 1729318#L26 call #t~ret0 := fact(~n - 1);< 1729454#$Ultimate##0 ~n := #in~n; 1729460#L25 assume ~n <= 0;#res := 1; 1729459#factFINAL assume true; 1729453#factEXIT >#70#return; 1729452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729451#factFINAL assume true; 1729315#factEXIT >#70#return; 1729320#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729336#factFINAL assume true; 1729332#factEXIT >#70#return; 1729328#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729290#factFINAL assume true; 1729283#factEXIT >#78#return; 1729286#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1729303#$Ultimate##0 ~n := #in~n; 1729425#L25 assume ~n <= 0;#res := 1; 1729424#factFINAL assume true; 1729423#factEXIT >#80#return; 1729421#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1729422#$Ultimate##0 ~n := #in~n; 1729430#L25 assume !(~n <= 0); 1729415#L26 call #t~ret0 := fact(~n - 1);< 1729429#$Ultimate##0 ~n := #in~n; 1729445#L25 assume !(~n <= 0); 1729413#L26 call #t~ret0 := fact(~n - 1);< 1729417#$Ultimate##0 ~n := #in~n; 1729442#L25 assume !(~n <= 0); 1729414#L26 call #t~ret0 := fact(~n - 1);< 1729441#$Ultimate##0 ~n := #in~n; 1729444#L25 assume ~n <= 0;#res := 1; 1729443#factFINAL assume true; 1729440#factEXIT >#70#return; 1729439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729437#factFINAL assume true; 1729435#factEXIT >#70#return; 1729433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729431#factFINAL assume true; 1729427#factEXIT >#70#return; 1729416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729426#factFINAL assume true; 1729420#factEXIT >#82#return; 1729418#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1729410#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1729405#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1729401#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1729400#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1729398#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1729399#$Ultimate##0 ~n := #in~n; 1729419#L25 assume !(~n <= 0); 1729412#L26 call #t~ret0 := fact(~n - 1);< 1729417#$Ultimate##0 ~n := #in~n; 1729442#L25 assume !(~n <= 0); 1729414#L26 call #t~ret0 := fact(~n - 1);< 1729441#$Ultimate##0 ~n := #in~n; 1729442#L25 assume !(~n <= 0); 1729414#L26 call #t~ret0 := fact(~n - 1);< 1729441#$Ultimate##0 ~n := #in~n; 1729442#L25 assume !(~n <= 0); 1729414#L26 call #t~ret0 := fact(~n - 1);< 1729441#$Ultimate##0 ~n := #in~n; 1729444#L25 assume ~n <= 0;#res := 1; 1729443#factFINAL assume true; 1729440#factEXIT >#70#return; 1729439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729437#factFINAL assume true; 1729435#factEXIT >#70#return; 1729433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729431#factFINAL assume true; 1729427#factEXIT >#70#return; 1729428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729438#factFINAL assume true; 1729411#factEXIT >#70#return; 1729409#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729404#factFINAL assume true; 1729397#factEXIT >#78#return; 1729393#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1729394#$Ultimate##0 ~n := #in~n; 1729408#L25 assume ~n <= 0;#res := 1; 1729403#factFINAL assume true; 1729392#factEXIT >#80#return; 1729232#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1729233#$Ultimate##0 ~n := #in~n; 1729365#L25 assume !(~n <= 0); 1729240#L26 call #t~ret0 := fact(~n - 1);< 1729247#$Ultimate##0 ~n := #in~n; 1729396#L25 assume !(~n <= 0); 1729242#L26 call #t~ret0 := fact(~n - 1);< 1729269#$Ultimate##0 ~n := #in~n; 1729342#L25 assume !(~n <= 0); 1729226#L26 call #t~ret0 := fact(~n - 1);< 1729229#$Ultimate##0 ~n := #in~n; 1729245#L25 assume !(~n <= 0); 1729227#L26 call #t~ret0 := fact(~n - 1);< 1729244#$Ultimate##0 ~n := #in~n; 1729349#L25 assume ~n <= 0;#res := 1; 1729348#factFINAL assume true; 1729345#factEXIT >#70#return; 1729344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729343#factFINAL assume true; 1729341#factEXIT >#70#return; 1729340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729272#factFINAL assume true; 1729267#factEXIT >#70#return; 1729265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729246#factFINAL assume true; 1729239#factEXIT >#70#return; 1729243#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729279#factFINAL assume true; 1729277#factEXIT >#82#return; 1729224#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1729222#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1729220#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1729219#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1729218#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1729216#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1729217#$Ultimate##0 ~n := #in~n; 1729234#L25 assume !(~n <= 0); 1729228#L26 call #t~ret0 := fact(~n - 1);< 1729229#$Ultimate##0 ~n := #in~n; 1729245#L25 assume !(~n <= 0); 1729227#L26 call #t~ret0 := fact(~n - 1);< 1729244#$Ultimate##0 ~n := #in~n; 1729245#L25 assume !(~n <= 0); 1729227#L26 call #t~ret0 := fact(~n - 1);< 1729244#$Ultimate##0 ~n := #in~n; 1729245#L25 assume !(~n <= 0); 1729227#L26 call #t~ret0 := fact(~n - 1);< 1729244#$Ultimate##0 ~n := #in~n; 1729245#L25 assume !(~n <= 0); 1729227#L26 call #t~ret0 := fact(~n - 1);< 1729244#$Ultimate##0 ~n := #in~n; 1729349#L25 assume ~n <= 0;#res := 1; 1729348#factFINAL assume true; 1729345#factEXIT >#70#return; 1729344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729343#factFINAL assume true; 1729341#factEXIT >#70#return; 1729340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729272#factFINAL assume true; 1729267#factEXIT >#70#return; 1729265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729246#factFINAL assume true; 1729239#factEXIT >#70#return; 1729238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729237#factFINAL assume true; 1729225#factEXIT >#70#return; 1729223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729221#factFINAL assume true; 1729215#factEXIT >#78#return; 1729212#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1729213#$Ultimate##0 ~n := #in~n; 1729353#L25 assume ~n <= 0;#res := 1; 1729352#factFINAL assume true; 1729211#factEXIT >#80#return; 1729204#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1729205#$Ultimate##0 ~n := #in~n; 1729369#L25 assume !(~n <= 0); 1729359#L26 call #t~ret0 := fact(~n - 1);< 1729368#$Ultimate##0 ~n := #in~n; 1729374#L25 assume !(~n <= 0); 1729372#L26 call #t~ret0 := fact(~n - 1);< 1729373#$Ultimate##0 ~n := #in~n; 1729379#L25 assume !(~n <= 0); 1729208#L26 call #t~ret0 := fact(~n - 1);< 1729210#$Ultimate##0 ~n := #in~n; 1729363#L25 assume !(~n <= 0); 1729207#L26 call #t~ret0 := fact(~n - 1);< 1729361#$Ultimate##0 ~n := #in~n; 1729363#L25 assume !(~n <= 0); 1729207#L26 call #t~ret0 := fact(~n - 1);< 1729361#$Ultimate##0 ~n := #in~n; 1729387#L25 assume ~n <= 0;#res := 1; 1729386#factFINAL assume true; 1729385#factEXIT >#70#return; 1729384#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729383#factFINAL assume true; 1729382#factEXIT >#70#return; 1729381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729380#factFINAL assume true; 1729378#factEXIT >#70#return; 1729376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729375#factFINAL assume true; 1729371#factEXIT >#70#return; 1729370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729367#factFINAL assume true; 1729358#factEXIT >#70#return; 1729360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729377#factFINAL assume true; 1729203#factEXIT >#82#return; 1729201#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1729199#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1729198#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1729197#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1729196#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1729193#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1729194#$Ultimate##0 ~n := #in~n; 1729214#L25 assume !(~n <= 0); 1729209#L26 call #t~ret0 := fact(~n - 1);< 1729210#$Ultimate##0 ~n := #in~n; 1729363#L25 assume !(~n <= 0); 1729207#L26 call #t~ret0 := fact(~n - 1);< 1729361#$Ultimate##0 ~n := #in~n; 1729363#L25 assume !(~n <= 0); 1729207#L26 call #t~ret0 := fact(~n - 1);< 1729361#$Ultimate##0 ~n := #in~n; 1729363#L25 assume !(~n <= 0); 1729207#L26 call #t~ret0 := fact(~n - 1);< 1729361#$Ultimate##0 ~n := #in~n; 1729363#L25 assume !(~n <= 0); 1729207#L26 call #t~ret0 := fact(~n - 1);< 1729361#$Ultimate##0 ~n := #in~n; 1729363#L25 assume !(~n <= 0); 1729207#L26 call #t~ret0 := fact(~n - 1);< 1729361#$Ultimate##0 ~n := #in~n; 1729387#L25 assume ~n <= 0;#res := 1; 1729386#factFINAL assume true; 1729385#factEXIT >#70#return; 1729384#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729383#factFINAL assume true; 1729382#factEXIT >#70#return; 1729381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729380#factFINAL assume true; 1729378#factEXIT >#70#return; 1729376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729375#factFINAL assume true; 1729371#factEXIT >#70#return; 1729370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729367#factFINAL assume true; 1729358#factEXIT >#70#return; 1729357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729356#factFINAL assume true; 1729206#factEXIT >#70#return; 1729202#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729200#factFINAL assume true; 1729192#factEXIT >#78#return; 1728930#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1728931#$Ultimate##0 ~n := #in~n; 1729323#L25 assume ~n <= 0;#res := 1; 1728941#factFINAL assume true; 1728929#factEXIT >#80#return; 1728920#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1728924#$Ultimate##0 ~n := #in~n; 1728922#L25 assume !(~n <= 0); 1728904#L26 call #t~ret0 := fact(~n - 1);< 1728921#$Ultimate##0 ~n := #in~n; 1728928#L25 assume !(~n <= 0); 1728926#L26 call #t~ret0 := fact(~n - 1);< 1728927#$Ultimate##0 ~n := #in~n; 1728962#L25 assume !(~n <= 0); 1728960#L26 call #t~ret0 := fact(~n - 1);< 1728961#$Ultimate##0 ~n := #in~n; 1728971#L25 assume !(~n <= 0); 1728968#L26 call #t~ret0 := fact(~n - 1);< 1728969#$Ultimate##0 ~n := #in~n; 1728975#L25 assume !(~n <= 0); 1728897#L26 call #t~ret0 := fact(~n - 1);< 1728898#$Ultimate##0 ~n := #in~n; 1728908#L25 assume !(~n <= 0); 1728896#L26 call #t~ret0 := fact(~n - 1);< 1728906#$Ultimate##0 ~n := #in~n; 1728980#L25 assume ~n <= 0;#res := 1; 1728979#factFINAL assume true; 1728978#factEXIT >#70#return; 1728977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728976#factFINAL assume true; 1728974#factEXIT >#70#return; 1728973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728972#factFINAL assume true; 1728967#factEXIT >#70#return; 1728966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728964#factFINAL assume true; 1728959#factEXIT >#70#return; 1728956#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728954#factFINAL assume true; 1728925#factEXIT >#70#return; 1728923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728919#factFINAL assume true; 1728903#factEXIT >#70#return; 1728905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728937#factFINAL assume true; 1728935#factEXIT >#82#return; 1728932#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1728787#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1728786#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1728784#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1728776#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1728773#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1728774#$Ultimate##0 ~n := #in~n; 1728899#L25 assume !(~n <= 0); 1728895#L26 call #t~ret0 := fact(~n - 1);< 1728898#$Ultimate##0 ~n := #in~n; 1728908#L25 assume !(~n <= 0); 1728896#L26 call #t~ret0 := fact(~n - 1);< 1728906#$Ultimate##0 ~n := #in~n; 1728908#L25 assume !(~n <= 0); 1728896#L26 call #t~ret0 := fact(~n - 1);< 1728906#$Ultimate##0 ~n := #in~n; 1728908#L25 assume !(~n <= 0); 1728896#L26 call #t~ret0 := fact(~n - 1);< 1728906#$Ultimate##0 ~n := #in~n; 1728908#L25 assume !(~n <= 0); 1728896#L26 call #t~ret0 := fact(~n - 1);< 1728906#$Ultimate##0 ~n := #in~n; 1728908#L25 assume !(~n <= 0); 1728896#L26 call #t~ret0 := fact(~n - 1);< 1728906#$Ultimate##0 ~n := #in~n; 1728908#L25 assume !(~n <= 0); 1728896#L26 call #t~ret0 := fact(~n - 1);< 1728906#$Ultimate##0 ~n := #in~n; 1728980#L25 assume ~n <= 0;#res := 1; 1728979#factFINAL assume true; 1728978#factEXIT >#70#return; 1728977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728976#factFINAL assume true; 1728974#factEXIT >#70#return; 1728973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728972#factFINAL assume true; 1728967#factEXIT >#70#return; 1728966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728964#factFINAL assume true; 1728959#factEXIT >#70#return; 1728956#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728954#factFINAL assume true; 1728925#factEXIT >#70#return; 1728923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728919#factFINAL assume true; 1728903#factEXIT >#70#return; 1728901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728900#factFINAL assume true; 1728894#factEXIT >#70#return; 1728893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728892#factFINAL assume true; 1728772#factEXIT >#78#return; 1728769#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1728770#$Ultimate##0 ~n := #in~n; 1729156#L25 assume ~n <= 0;#res := 1; 1728879#factFINAL assume true; 1728768#factEXIT >#80#return; 1728761#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1728765#$Ultimate##0 ~n := #in~n; 1728763#L25 assume !(~n <= 0); 1728725#L26 call #t~ret0 := fact(~n - 1);< 1728759#$Ultimate##0 ~n := #in~n; 1729864#L25 assume !(~n <= 0); 1728727#L26 call #t~ret0 := fact(~n - 1);< 1728851#$Ultimate##0 ~n := #in~n; 1729990#L25 assume !(~n <= 0); 1728738#L26 call #t~ret0 := fact(~n - 1);< 1728891#$Ultimate##0 ~n := #in~n; 1729992#L25 assume !(~n <= 0); 1728739#L26 call #t~ret0 := fact(~n - 1);< 1728910#$Ultimate##0 ~n := #in~n; 1729669#L25 assume !(~n <= 0); 1728732#L26 call #t~ret0 := fact(~n - 1);< 1728918#$Ultimate##0 ~n := #in~n; 1729938#L25 assume !(~n <= 0); 1728734#L26 call #t~ret0 := fact(~n - 1);< 1729008#$Ultimate##0 ~n := #in~n; 1729190#L25 assume !(~n <= 0); 1728737#L26 call #t~ret0 := fact(~n - 1);< 1729189#$Ultimate##0 ~n := #in~n; 1729195#L25 assume ~n <= 0;#res := 1; 1729191#factFINAL assume true; 1729188#factEXIT >#70#return; 1729185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729183#factFINAL assume true; 1729007#factEXIT >#70#return; 1729004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729002#factFINAL assume true; 1728917#factEXIT >#70#return; 1728916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728915#factFINAL assume true; 1728909#factEXIT >#70#return; 1728907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728902#factFINAL assume true; 1728890#factEXIT >#70#return; 1728889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728885#factFINAL assume true; 1728850#factEXIT >#70#return; 1728849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728760#factFINAL assume true; 1728757#factEXIT >#70#return; 1728758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1730075#factFINAL assume true; 1730072#factEXIT >#82#return; 1728820#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1730071#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1730070#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1730069#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1730066#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1728710#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1728714#$Ultimate##0 ~n := #in~n; 1728745#L25 assume !(~n <= 0); 1728728#L26 call #t~ret0 := fact(~n - 1);< 1728744#$Ultimate##0 ~n := #in~n; 1729262#L25 assume !(~n <= 0); 1728729#L26 call #t~ret0 := fact(~n - 1);< 1729260#$Ultimate##0 ~n := #in~n; 1729258#L25 assume !(~n <= 0); 1728731#L26 call #t~ret0 := fact(~n - 1);< 1729256#$Ultimate##0 ~n := #in~n; 1729254#L25 assume !(~n <= 0); 1728722#L26 call #t~ret0 := fact(~n - 1);< 1729253#$Ultimate##0 ~n := #in~n; 1729251#L25 assume !(~n <= 0); 1728726#L26 call #t~ret0 := fact(~n - 1);< 1729008#$Ultimate##0 ~n := #in~n; 1729190#L25 assume !(~n <= 0); 1728737#L26 call #t~ret0 := fact(~n - 1);< 1729189#$Ultimate##0 ~n := #in~n; 1729190#L25 assume !(~n <= 0); 1728737#L26 call #t~ret0 := fact(~n - 1);< 1729189#$Ultimate##0 ~n := #in~n; 1729190#L25 assume !(~n <= 0); 1728737#L26 call #t~ret0 := fact(~n - 1);< 1729189#$Ultimate##0 ~n := #in~n; 1729195#L25 assume ~n <= 0;#res := 1; 1729191#factFINAL assume true; 1729188#factEXIT >#70#return; 1729185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729183#factFINAL assume true; 1729007#factEXIT >#70#return; 1729004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729002#factFINAL assume true; 1728917#factEXIT >#70#return; 1728916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728915#factFINAL assume true; 1728909#factEXIT >#70#return; 1728907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728902#factFINAL assume true; 1728890#factEXIT >#70#return; 1728889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728885#factFINAL assume true; 1728850#factEXIT >#70#return; 1728849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728760#factFINAL assume true; 1728757#factEXIT >#70#return; 1728756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728746#factFINAL assume true; 1728721#factEXIT >#70#return; 1728719#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728715#factFINAL assume true; 1728707#factEXIT >#78#return; 1728712#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1728702#$Ultimate##0 ~n := #in~n; 1730074#L25 assume ~n <= 0;#res := 1; 1730073#factFINAL assume true; 1728785#factEXIT >#80#return; 1728779#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1728783#$Ultimate##0 ~n := #in~n; 1728914#L25 assume !(~n <= 0); 1728859#L26 call #t~ret0 := fact(~n - 1);< 1728913#$Ultimate##0 ~n := #in~n; 1729469#L25 assume !(~n <= 0); 1728872#L26 call #t~ret0 := fact(~n - 1);< 1729115#$Ultimate##0 ~n := #in~n; 1729388#L25 assume !(~n <= 0); 1728868#L26 call #t~ret0 := fact(~n - 1);< 1729123#$Ultimate##0 ~n := #in~n; 1730086#L25 assume !(~n <= 0); 1728856#L26 call #t~ret0 := fact(~n - 1);< 1729129#$Ultimate##0 ~n := #in~n; 1729389#L25 assume !(~n <= 0); 1728874#L26 call #t~ret0 := fact(~n - 1);< 1729136#$Ultimate##0 ~n := #in~n; 1729390#L25 assume !(~n <= 0); 1728861#L26 call #t~ret0 := fact(~n - 1);< 1729154#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729174#L25 assume ~n <= 0;#res := 1; 1729173#factFINAL assume true; 1729163#factEXIT >#70#return; 1729161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729160#factFINAL assume true; 1729159#factEXIT >#70#return; 1729158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729157#factFINAL assume true; 1729153#factEXIT >#70#return; 1729152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729151#factFINAL assume true; 1729135#factEXIT >#70#return; 1729134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729133#factFINAL assume true; 1729128#factEXIT >#70#return; 1729126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729125#factFINAL assume true; 1729122#factEXIT >#70#return; 1729121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729118#factFINAL assume true; 1729114#factEXIT >#70#return; 1729113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729112#factFINAL assume true; 1728886#factEXIT >#70#return; 1728887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728911#factFINAL assume true; 1728777#factEXIT >#82#return; 1728775#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1728771#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1728767#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1728766#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1728764#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1728751#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1728755#$Ultimate##0 ~n := #in~n; 1729137#L25 assume !(~n <= 0); 1728866#L26 call #t~ret0 := fact(~n - 1);< 1728878#$Ultimate##0 ~n := #in~n; 1729278#L25 assume !(~n <= 0); 1728863#L26 call #t~ret0 := fact(~n - 1);< 1729276#$Ultimate##0 ~n := #in~n; 1729274#L25 assume !(~n <= 0); 1728854#L26 call #t~ret0 := fact(~n - 1);< 1729271#$Ultimate##0 ~n := #in~n; 1729270#L25 assume !(~n <= 0); 1728870#L26 call #t~ret0 := fact(~n - 1);< 1729266#$Ultimate##0 ~n := #in~n; 1729264#L25 assume !(~n <= 0); 1728873#L26 call #t~ret0 := fact(~n - 1);< 1729154#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729174#L25 assume ~n <= 0;#res := 1; 1729173#factFINAL assume true; 1729163#factEXIT >#70#return; 1729161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729160#factFINAL assume true; 1729159#factEXIT >#70#return; 1729158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729157#factFINAL assume true; 1729153#factEXIT >#70#return; 1729152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729151#factFINAL assume true; 1729135#factEXIT >#70#return; 1729134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729133#factFINAL assume true; 1729128#factEXIT >#70#return; 1729126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729125#factFINAL assume true; 1729122#factEXIT >#70#return; 1729121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729118#factFINAL assume true; 1729114#factEXIT >#70#return; 1729113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729112#factFINAL assume true; 1728886#factEXIT >#70#return; 1728884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728880#factFINAL assume true; 1728853#factEXIT >#70#return; 1728852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728762#factFINAL assume true; 1728750#factEXIT >#78#return; 1728754#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1728134#$Ultimate##0 ~n := #in~n; 1729871#L25 assume ~n <= 0;#res := 1; 1729870#factFINAL assume true; 1729836#factEXIT >#80#return; 1729824#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1729833#$Ultimate##0 ~n := #in~n; 1729907#L25 assume !(~n <= 0); 1728862#L26 call #t~ret0 := fact(~n - 1);< 1728883#$Ultimate##0 ~n := #in~n; 1729865#L25 assume !(~n <= 0); 1728860#L26 call #t~ret0 := fact(~n - 1);< 1728888#$Ultimate##0 ~n := #in~n; 1729366#L25 assume !(~n <= 0); 1728869#L26 call #t~ret0 := fact(~n - 1);< 1729364#$Ultimate##0 ~n := #in~n; 1729362#L25 assume !(~n <= 0); 1728865#L26 call #t~ret0 := fact(~n - 1);< 1729355#$Ultimate##0 ~n := #in~n; 1729354#L25 assume !(~n <= 0); 1728867#L26 call #t~ret0 := fact(~n - 1);< 1729351#$Ultimate##0 ~n := #in~n; 1729350#L25 assume !(~n <= 0); 1728864#L26 call #t~ret0 := fact(~n - 1);< 1729347#$Ultimate##0 ~n := #in~n; 1729346#L25 assume !(~n <= 0); 1728855#L26 call #t~ret0 := fact(~n - 1);< 1729236#$Ultimate##0 ~n := #in~n; 1729235#L25 assume !(~n <= 0); 1728871#L26 call #t~ret0 := fact(~n - 1);< 1729154#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729174#L25 assume ~n <= 0;#res := 1; 1729173#factFINAL assume true; 1729163#factEXIT >#70#return; 1729161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729160#factFINAL assume true; 1729159#factEXIT >#70#return; 1729158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729157#factFINAL assume true; 1729153#factEXIT >#70#return; 1729152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729151#factFINAL assume true; 1729135#factEXIT >#70#return; 1729134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729133#factFINAL assume true; 1729128#factEXIT >#70#return; 1729126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729125#factFINAL assume true; 1729122#factEXIT >#70#return; 1729121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729118#factFINAL assume true; 1729114#factEXIT >#70#return; 1729113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729112#factFINAL assume true; 1728886#factEXIT >#70#return; 1728884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728880#factFINAL assume true; 1728853#factEXIT >#70#return; 1728875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729927#factFINAL assume true; 1729925#factEXIT >#70#return; 1729856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729980#factFINAL assume true; 1729875#factEXIT >#82#return; 1728781#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1729680#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1729679#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1729677#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1729670#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1728753#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1728755#$Ultimate##0 ~n := #in~n; 1729137#L25 assume !(~n <= 0); 1728866#L26 call #t~ret0 := fact(~n - 1);< 1728878#$Ultimate##0 ~n := #in~n; 1729278#L25 assume !(~n <= 0); 1728863#L26 call #t~ret0 := fact(~n - 1);< 1729276#$Ultimate##0 ~n := #in~n; 1729274#L25 assume !(~n <= 0); 1728854#L26 call #t~ret0 := fact(~n - 1);< 1729271#$Ultimate##0 ~n := #in~n; 1729270#L25 assume !(~n <= 0); 1728870#L26 call #t~ret0 := fact(~n - 1);< 1729266#$Ultimate##0 ~n := #in~n; 1729264#L25 assume !(~n <= 0); 1728873#L26 call #t~ret0 := fact(~n - 1);< 1729154#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729169#L25 assume !(~n <= 0); 1728858#L26 call #t~ret0 := fact(~n - 1);< 1729164#$Ultimate##0 ~n := #in~n; 1729174#L25 assume ~n <= 0;#res := 1; 1729173#factFINAL assume true; 1729163#factEXIT >#70#return; 1729161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729160#factFINAL assume true; 1729159#factEXIT >#70#return; 1729158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729157#factFINAL assume true; 1729153#factEXIT >#70#return; 1729152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729151#factFINAL assume true; 1729135#factEXIT >#70#return; 1729134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729133#factFINAL assume true; 1729128#factEXIT >#70#return; 1729126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729125#factFINAL assume true; 1729122#factEXIT >#70#return; 1729121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729118#factFINAL assume true; 1729114#factEXIT >#70#return; 1729113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729112#factFINAL assume true; 1728886#factEXIT >#70#return; 1728884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728880#factFINAL assume true; 1728853#factEXIT >#70#return; 1728852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728762#factFINAL assume true; 1728750#factEXIT >#78#return; 1728123#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1728129#$Ultimate##0 ~n := #in~n; 1728836#L25 assume ~n <= 0;#res := 1; 1728835#factFINAL assume true; 1728833#factEXIT >#80#return; 1728265#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1728577#$Ultimate##0 ~n := #in~n; 1728581#L25 assume !(~n <= 0); 1728161#L26 call #t~ret0 := fact(~n - 1);< 1728580#$Ultimate##0 ~n := #in~n; 1730108#L25 assume !(~n <= 0); 1728179#L26 call #t~ret0 := fact(~n - 1);< 1728573#$Ultimate##0 ~n := #in~n; 1729667#L25 assume !(~n <= 0); 1728158#L26 call #t~ret0 := fact(~n - 1);< 1731284#$Ultimate##0 ~n := #in~n; 1731283#L25 assume !(~n <= 0); 1728177#L26 call #t~ret0 := fact(~n - 1);< 1731282#$Ultimate##0 ~n := #in~n; 1731281#L25 assume !(~n <= 0); 1728151#L26 call #t~ret0 := fact(~n - 1);< 1731279#$Ultimate##0 ~n := #in~n; 1731278#L25 assume !(~n <= 0); 1728169#L26 call #t~ret0 := fact(~n - 1);< 1731277#$Ultimate##0 ~n := #in~n; 1731276#L25 assume !(~n <= 0); 1728149#L26 call #t~ret0 := fact(~n - 1);< 1731263#$Ultimate##0 ~n := #in~n; 1731275#L25 assume !(~n <= 0); 1728167#L26 call #t~ret0 := fact(~n - 1);< 1731267#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731273#L25 assume ~n <= 0;#res := 1; 1731272#factFINAL assume true; 1731270#factEXIT >#70#return; 1731269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731268#factFINAL assume true; 1731266#factEXIT >#70#return; 1731265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731264#factFINAL assume true; 1731262#factEXIT >#70#return; 1731261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731260#factFINAL assume true; 1731255#factEXIT >#70#return; 1731253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729077#factFINAL assume true; 1728847#factEXIT >#70#return; 1728843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728841#factFINAL assume true; 1728687#factEXIT >#70#return; 1728686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728684#factFINAL assume true; 1728680#factEXIT >#70#return; 1728679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728678#factFINAL assume true; 1728572#factEXIT >#70#return; 1728571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728449#factFINAL assume true; 1728411#factEXIT >#70#return; 1728412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729031#factFINAL assume true; 1728264#factEXIT >#82#return; 1727992#L30-8 [2023-11-29 01:20:52,744 INFO L750 eck$LassoCheckResult]: Loop: 1727992#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1727990#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1727987#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1727985#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1727981#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1720437#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1720438#$Ultimate##0 ~n := #in~n; 1728197#L25 assume !(~n <= 0); 1728162#L26 call #t~ret0 := fact(~n - 1);< 1728190#$Ultimate##0 ~n := #in~n; 1728214#L25 assume !(~n <= 0); 1728180#L26 call #t~ret0 := fact(~n - 1);< 1728194#$Ultimate##0 ~n := #in~n; 1728207#L25 assume !(~n <= 0); 1728159#L26 call #t~ret0 := fact(~n - 1);< 1728203#$Ultimate##0 ~n := #in~n; 1728238#L25 assume !(~n <= 0); 1728178#L26 call #t~ret0 := fact(~n - 1);< 1728205#$Ultimate##0 ~n := #in~n; 1729616#L25 assume !(~n <= 0); 1728152#L26 call #t~ret0 := fact(~n - 1);< 1731267#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731273#L25 assume ~n <= 0;#res := 1; 1731272#factFINAL assume true; 1731270#factEXIT >#70#return; 1731269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731268#factFINAL assume true; 1731266#factEXIT >#70#return; 1731265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731264#factFINAL assume true; 1731262#factEXIT >#70#return; 1731261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731260#factFINAL assume true; 1731255#factEXIT >#70#return; 1731253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729077#factFINAL assume true; 1728847#factEXIT >#70#return; 1728843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728841#factFINAL assume true; 1728687#factEXIT >#70#return; 1728686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728684#factFINAL assume true; 1728680#factEXIT >#70#return; 1728679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728678#factFINAL assume true; 1728572#factEXIT >#70#return; 1728571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728449#factFINAL assume true; 1728411#factEXIT >#70#return; 1728408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728407#factFINAL assume true; 1728402#factEXIT >#70#return; 1728398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728396#factFINAL assume true; 1728394#factEXIT >#70#return; 1728390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728389#factFINAL assume true; 1728386#factEXIT >#70#return; 1728346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728341#factFINAL assume true; 1728314#factEXIT >#70#return; 1728256#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728254#factFINAL assume true; 1728251#factEXIT >#70#return; 1728248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728245#factFINAL assume true; 1728228#factEXIT >#70#return; 1728226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728220#factFINAL assume true; 1728218#factEXIT >#70#return; 1728216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728211#factFINAL assume true; 1728209#factEXIT >#70#return; 1728208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728204#factFINAL assume true; 1728195#factEXIT >#70#return; 1728196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728206#factFINAL assume true; 1728202#factEXIT >#70#return; 1728201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728200#factFINAL assume true; 1728199#factEXIT >#70#return; 1728185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728192#factFINAL assume true; 1728146#factEXIT >#70#return; 1728144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728140#factFINAL assume true; 1728138#factEXIT >#78#return; 1728119#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1728122#$Ultimate##0 ~n := #in~n; 1728139#L25 assume ~n <= 0;#res := 1; 1728137#factFINAL assume true; 1728118#factEXIT >#80#return; 1727994#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1728141#$Ultimate##0 ~n := #in~n; 1728198#L25 assume !(~n <= 0); 1728171#L26 call #t~ret0 := fact(~n - 1);< 1728193#$Ultimate##0 ~n := #in~n; 1729660#L25 assume !(~n <= 0); 1728182#L26 call #t~ret0 := fact(~n - 1);< 1728210#$Ultimate##0 ~n := #in~n; 1731719#L25 assume !(~n <= 0); 1728173#L26 call #t~ret0 := fact(~n - 1);< 1728219#$Ultimate##0 ~n := #in~n; 1728936#L25 assume !(~n <= 0); 1728174#L26 call #t~ret0 := fact(~n - 1);< 1728230#$Ultimate##0 ~n := #in~n; 1728996#L25 assume !(~n <= 0); 1728165#L26 call #t~ret0 := fact(~n - 1);< 1728252#$Ultimate##0 ~n := #in~n; 1729083#L25 assume !(~n <= 0); 1728175#L26 call #t~ret0 := fact(~n - 1);< 1728315#$Ultimate##0 ~n := #in~n; 1728454#L25 assume !(~n <= 0); 1728163#L26 call #t~ret0 := fact(~n - 1);< 1728387#$Ultimate##0 ~n := #in~n; 1728405#L25 assume !(~n <= 0); 1728176#L26 call #t~ret0 := fact(~n - 1);< 1728395#$Ultimate##0 ~n := #in~n; 1732433#L25 assume !(~n <= 0); 1728160#L26 call #t~ret0 := fact(~n - 1);< 1728403#$Ultimate##0 ~n := #in~n; 1731254#L25 assume !(~n <= 0); 1728157#L26 call #t~ret0 := fact(~n - 1);< 1728413#$Ultimate##0 ~n := #in~n; 1730108#L25 assume !(~n <= 0); 1728179#L26 call #t~ret0 := fact(~n - 1);< 1728573#$Ultimate##0 ~n := #in~n; 1729667#L25 assume !(~n <= 0); 1728158#L26 call #t~ret0 := fact(~n - 1);< 1731284#$Ultimate##0 ~n := #in~n; 1731283#L25 assume !(~n <= 0); 1728177#L26 call #t~ret0 := fact(~n - 1);< 1731282#$Ultimate##0 ~n := #in~n; 1731281#L25 assume !(~n <= 0); 1728151#L26 call #t~ret0 := fact(~n - 1);< 1731279#$Ultimate##0 ~n := #in~n; 1731278#L25 assume !(~n <= 0); 1728169#L26 call #t~ret0 := fact(~n - 1);< 1731277#$Ultimate##0 ~n := #in~n; 1731276#L25 assume !(~n <= 0); 1728149#L26 call #t~ret0 := fact(~n - 1);< 1731263#$Ultimate##0 ~n := #in~n; 1731275#L25 assume !(~n <= 0); 1728167#L26 call #t~ret0 := fact(~n - 1);< 1731267#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731274#L25 assume !(~n <= 0); 1728155#L26 call #t~ret0 := fact(~n - 1);< 1731271#$Ultimate##0 ~n := #in~n; 1731273#L25 assume ~n <= 0;#res := 1; 1731272#factFINAL assume true; 1731270#factEXIT >#70#return; 1731269#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731268#factFINAL assume true; 1731266#factEXIT >#70#return; 1731265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731264#factFINAL assume true; 1731262#factEXIT >#70#return; 1731261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1731260#factFINAL assume true; 1731255#factEXIT >#70#return; 1731253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1729077#factFINAL assume true; 1728847#factEXIT >#70#return; 1728843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728841#factFINAL assume true; 1728687#factEXIT >#70#return; 1728686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728684#factFINAL assume true; 1728680#factEXIT >#70#return; 1728679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728678#factFINAL assume true; 1728572#factEXIT >#70#return; 1728571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728449#factFINAL assume true; 1728411#factEXIT >#70#return; 1728408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728407#factFINAL assume true; 1728402#factEXIT >#70#return; 1728398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728396#factFINAL assume true; 1728394#factEXIT >#70#return; 1728390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728389#factFINAL assume true; 1728386#factEXIT >#70#return; 1728346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728341#factFINAL assume true; 1728314#factEXIT >#70#return; 1728256#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728254#factFINAL assume true; 1728251#factEXIT >#70#return; 1728248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728245#factFINAL assume true; 1728228#factEXIT >#70#return; 1728226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728220#factFINAL assume true; 1728218#factEXIT >#70#return; 1728216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728211#factFINAL assume true; 1728209#factEXIT >#70#return; 1728208#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728204#factFINAL assume true; 1728195#factEXIT >#70#return; 1728196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728206#factFINAL assume true; 1728202#factEXIT >#70#return; 1728201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728200#factFINAL assume true; 1728199#factEXIT >#70#return; 1728185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728192#factFINAL assume true; 1728146#factEXIT >#70#return; 1728144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1728140#factFINAL assume true; 1728138#factEXIT >#82#return; 1727992#L30-8 [2023-11-29 01:20:52,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:52,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2056879034, now seen corresponding path program 29 times [2023-11-29 01:20:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:20:52,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262659427] [2023-11-29 01:20:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:20:52,792 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:20:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935834872] [2023-11-29 01:20:52,792 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:20:52,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:20:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:20:52,794 INFO L229 MonitoredProcess]: Starting monitored process 589 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:20:52,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (589)] Waiting until timeout for monitored process [2023-11-29 01:20:57,994 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2023-11-29 01:20:57,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:20:58,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 01:20:58,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 52178 backedges. 18675 proven. 1509 refuted. 0 times theorem prover too weak. 31994 trivial. 0 not checked. [2023-11-29 01:20:58,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 52178 backedges. 5235 proven. 2845 refuted. 0 times theorem prover too weak. 44098 trivial. 0 not checked. [2023-11-29 01:21:03,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:21:03,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262659427] [2023-11-29 01:21:03,647 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:21:03,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935834872] [2023-11-29 01:21:03,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935834872] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:21:03,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:21:03,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 38] total 41 [2023-11-29 01:21:03,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888577445] [2023-11-29 01:21:03,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:21:03,649 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:21:03,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 320425724, now seen corresponding path program 30 times [2023-11-29 01:21:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:21:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045492288] [2023-11-29 01:21:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:21:03,685 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:21:03,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60240315] [2023-11-29 01:21:03,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:21:03,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:21:03,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:03,687 INFO L229 MonitoredProcess]: Starting monitored process 590 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:21:03,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (590)] Waiting until timeout for monitored process [2023-11-29 01:21:09,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2023-11-29 01:21:09,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:21:09,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:21:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:21:14,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:21:16,384 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:21:16,384 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:21:16,384 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:21:16,384 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:21:16,384 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:21:16,384 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,384 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:21:16,384 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:21:16,384 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration64_Loop [2023-11-29 01:21:16,384 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:21:16,384 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:21:16,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,480 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:21:16,480 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:21:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,482 INFO L229 MonitoredProcess]: Starting monitored process 591 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (591)] Waiting until timeout for monitored process [2023-11-29 01:21:16,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:16,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:16,495 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:16,496 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=21} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:16,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (591)] Ended with exit code 0 [2023-11-29 01:21:16,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,499 INFO L229 MonitoredProcess]: Starting monitored process 592 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (592)] Waiting until timeout for monitored process [2023-11-29 01:21:16,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:16,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:16,513 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:16,513 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:16,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (592)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,517 INFO L229 MonitoredProcess]: Starting monitored process 593 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (593)] Waiting until timeout for monitored process [2023-11-29 01:21:16,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:16,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:16,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (593)] Ended with exit code 0 [2023-11-29 01:21:16,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,534 INFO L229 MonitoredProcess]: Starting monitored process 594 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (594)] Waiting until timeout for monitored process [2023-11-29 01:21:16,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:21:16,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:16,549 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:21:16,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (594)] Ended with exit code 0 [2023-11-29 01:21:16,552 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:21:16,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:21:16,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:21:16,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:21:16,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:21:16,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:21:16,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:21:16,552 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration64_Loop [2023-11-29 01:21:16,552 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:21:16,552 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:21:16,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:16,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:21:16,650 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:21:16,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,652 INFO L229 MonitoredProcess]: Starting monitored process 595 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (595)] Waiting until timeout for monitored process [2023-11-29 01:21:16,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:16,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:16,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:16,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:16,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:16,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:16,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:16,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:16,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:16,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (595)] Ended with exit code 0 [2023-11-29 01:21:16,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,669 INFO L229 MonitoredProcess]: Starting monitored process 596 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (596)] Waiting until timeout for monitored process [2023-11-29 01:21:16,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:16,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:16,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:16,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:16,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:16,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:16,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:16,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:16,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:16,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (596)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:16,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,687 INFO L229 MonitoredProcess]: Starting monitored process 597 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (597)] Waiting until timeout for monitored process [2023-11-29 01:21:16,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:16,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:16,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:16,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:16,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:16,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:16,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:16,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:16,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:21:16,704 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:21:16,704 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:21:16,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:16,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:16,706 INFO L229 MonitoredProcess]: Starting monitored process 598 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:16,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (598)] Waiting until timeout for monitored process [2023-11-29 01:21:16,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:21:16,708 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:21:16,708 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:21:16,708 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 41 Supporting invariants [] [2023-11-29 01:21:16,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (597)] Ended with exit code 0 [2023-11-29 01:21:16,711 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:21:16,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:17,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (598)] Ended with exit code 0 [2023-11-29 01:21:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:17,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 5851 conjuncts, 286 conjunts are in the unsatisfiable core [2023-11-29 01:21:17,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:24,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 140 conjunts are in the unsatisfiable core [2023-11-29 01:21:24,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5682 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2023-11-29 01:21:26,189 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 28 loop predicates [2023-11-29 01:21:26,189 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17902 states and 58621 transitions. cyclomatic complexity: 40819 Second operand has 31 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 6 states have call successors, (12), 2 states have call predecessors, (12), 24 states have return successors, (33), 26 states have call predecessors, (33), 6 states have call successors, (33) [2023-11-29 01:21:27,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17902 states and 58621 transitions. cyclomatic complexity: 40819. Second operand has 31 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 6 states have call successors, (12), 2 states have call predecessors, (12), 24 states have return successors, (33), 26 states have call predecessors, (33), 6 states have call successors, (33) Result 37103 states and 95413 transitions. Complement of second has 155 states. [2023-11-29 01:21:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 2 stem states 27 non-accepting loop states 1 accepting loop states [2023-11-29 01:21:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 6 states have call successors, (12), 2 states have call predecessors, (12), 24 states have return successors, (33), 26 states have call predecessors, (33), 6 states have call successors, (33) [2023-11-29 01:21:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 166 transitions. [2023-11-29 01:21:27,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 166 transitions. Stem has 876 letters. Loop has 272 letters. [2023-11-29 01:21:27,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:21:27,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 166 transitions. Stem has 1148 letters. Loop has 272 letters. [2023-11-29 01:21:27,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:21:27,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 166 transitions. Stem has 876 letters. Loop has 544 letters. [2023-11-29 01:21:27,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:21:27,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37103 states and 95413 transitions. [2023-11-29 01:21:28,272 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1705 [2023-11-29 01:21:28,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37103 states to 24163 states and 68723 transitions. [2023-11-29 01:21:28,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5633 [2023-11-29 01:21:28,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5647 [2023-11-29 01:21:28,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24163 states and 68723 transitions. [2023-11-29 01:21:28,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:21:28,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24163 states and 68723 transitions. [2023-11-29 01:21:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24163 states and 68723 transitions. [2023-11-29 01:21:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24163 to 18580. [2023-11-29 01:21:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18580 states, 9942 states have (on average 1.027559847113257) internal successors, (10216), 9874 states have internal predecessors, (10216), 6804 states have call successors, (7522), 1899 states have call predecessors, (7522), 1834 states have return successors, (43387), 6806 states have call predecessors, (43387), 6804 states have call successors, (43387) [2023-11-29 01:21:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18580 states to 18580 states and 61125 transitions. [2023-11-29 01:21:29,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18580 states and 61125 transitions. [2023-11-29 01:21:29,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:21:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 01:21:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 01:21:29,790 INFO L87 Difference]: Start difference. First operand 18580 states and 61125 transitions. Second operand has 41 states, 38 states have (on average 3.210526315789474) internal successors, (122), 41 states have internal predecessors, (122), 25 states have call successors, (55), 2 states have call predecessors, (55), 15 states have return successors, (64), 24 states have call predecessors, (64), 25 states have call successors, (64) [2023-11-29 01:21:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:32,384 INFO L93 Difference]: Finished difference Result 21166 states and 73407 transitions. [2023-11-29 01:21:32,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21166 states and 73407 transitions. [2023-11-29 01:21:32,826 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2401 [2023-11-29 01:21:33,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21166 states to 21159 states and 73343 transitions. [2023-11-29 01:21:33,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7138 [2023-11-29 01:21:33,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7138 [2023-11-29 01:21:33,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21159 states and 73343 transitions. [2023-11-29 01:21:33,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:21:33,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21159 states and 73343 transitions. [2023-11-29 01:21:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21159 states and 73343 transitions. [2023-11-29 01:21:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21159 to 20090. [2023-11-29 01:21:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20090 states, 10788 states have (on average 1.039395624768261) internal successors, (11213), 10705 states have internal predecessors, (11213), 7460 states have call successors, (8196), 1899 states have call predecessors, (8196), 1842 states have return successors, (47246), 7485 states have call predecessors, (47246), 7460 states have call successors, (47246) [2023-11-29 01:21:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 66655 transitions. [2023-11-29 01:21:34,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20090 states and 66655 transitions. [2023-11-29 01:21:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 01:21:34,302 INFO L428 stractBuchiCegarLoop]: Abstraction has 20090 states and 66655 transitions. [2023-11-29 01:21:34,302 INFO L335 stractBuchiCegarLoop]: ======== Iteration 65 ============ [2023-11-29 01:21:34,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20090 states and 66655 transitions. [2023-11-29 01:21:34,428 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2304 [2023-11-29 01:21:34,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:21:34,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:21:34,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [139, 139, 106, 106, 106, 106, 33, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:34,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [47, 47, 44, 44, 44, 44, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:21:34,431 INFO L748 eck$LassoCheckResult]: Stem: 1824312#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1824267#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1824268#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1824286#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1824313#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1825204#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1829373#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1829369#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1829370#$Ultimate##0 ~n := #in~n; 1829871#L25 assume ~n <= 0;#res := 1; 1829375#factFINAL assume true; 1829368#factEXIT >#72#return; 1829275#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1829276#$Ultimate##0 ~n := #in~n; 1829374#L25 assume ~n <= 0;#res := 1; 1829367#factFINAL assume true; 1829274#factEXIT >#74#return; 1829271#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1829272#$Ultimate##0 ~n := #in~n; 1829366#L25 assume ~n <= 0;#res := 1; 1829365#factFINAL assume true; 1829270#factEXIT >#76#return; 1829251#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1829247#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1829248#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839400#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839397#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1839361#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1839362#$Ultimate##0 ~n := #in~n; 1839399#L25 assume !(~n <= 0); 1839368#L26 call #t~ret0 := fact(~n - 1);< 1839369#$Ultimate##0 ~n := #in~n; 1839375#L25 assume ~n <= 0;#res := 1; 1839373#factFINAL assume true; 1839367#factEXIT >#70#return; 1839366#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839365#factFINAL assume true; 1839360#factEXIT >#78#return; 1839357#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1839358#$Ultimate##0 ~n := #in~n; 1839393#L25 assume ~n <= 0;#res := 1; 1839389#factFINAL assume true; 1839356#factEXIT >#80#return; 1839332#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1839333#$Ultimate##0 ~n := #in~n; 1841745#L25 assume !(~n <= 0); 1841741#L26 call #t~ret0 := fact(~n - 1);< 1841743#$Ultimate##0 ~n := #in~n; 1841754#L25 assume ~n <= 0;#res := 1; 1841755#factFINAL assume true; 1841740#factEXIT >#70#return; 1841735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1840086#factFINAL assume true; 1839331#factEXIT >#82#return; 1839328#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1839327#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1839326#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839325#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839311#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1839276#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1839277#$Ultimate##0 ~n := #in~n; 1839299#L25 assume !(~n <= 0); 1839293#L26 call #t~ret0 := fact(~n - 1);< 1839295#$Ultimate##0 ~n := #in~n; 1839308#L25 assume !(~n <= 0); 1839294#L26 call #t~ret0 := fact(~n - 1);< 1839305#$Ultimate##0 ~n := #in~n; 1839310#L25 assume ~n <= 0;#res := 1; 1839307#factFINAL assume true; 1839304#factEXIT >#70#return; 1839302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839298#factFINAL assume true; 1839292#factEXIT >#70#return; 1839289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839285#factFINAL assume true; 1839275#factEXIT >#78#return; 1839273#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1839274#$Ultimate##0 ~n := #in~n; 1839288#L25 assume ~n <= 0;#res := 1; 1839284#factFINAL assume true; 1839272#factEXIT >#80#return; 1839254#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1839264#$Ultimate##0 ~n := #in~n; 1839258#L25 assume !(~n <= 0); 1839220#L26 call #t~ret0 := fact(~n - 1);< 1839228#$Ultimate##0 ~n := #in~n; 1839281#L25 assume !(~n <= 0); 1839222#L26 call #t~ret0 := fact(~n - 1);< 1839263#$Ultimate##0 ~n := #in~n; 1839268#L25 assume ~n <= 0;#res := 1; 1839267#factFINAL assume true; 1839262#factEXIT >#70#return; 1839257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839253#factFINAL assume true; 1839245#factEXIT >#70#return; 1839246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839301#factFINAL assume true; 1839297#factEXIT >#82#return; 1839291#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1839287#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1839283#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839266#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839261#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1839205#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1839211#$Ultimate##0 ~n := #in~n; 1839235#L25 assume !(~n <= 0); 1839223#L26 call #t~ret0 := fact(~n - 1);< 1839228#$Ultimate##0 ~n := #in~n; 1839281#L25 assume !(~n <= 0); 1839222#L26 call #t~ret0 := fact(~n - 1);< 1839263#$Ultimate##0 ~n := #in~n; 1839281#L25 assume !(~n <= 0); 1839222#L26 call #t~ret0 := fact(~n - 1);< 1839263#$Ultimate##0 ~n := #in~n; 1839268#L25 assume ~n <= 0;#res := 1; 1839267#factFINAL assume true; 1839262#factEXIT >#70#return; 1839257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839253#factFINAL assume true; 1839245#factEXIT >#70#return; 1839238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839231#factFINAL assume true; 1839219#factEXIT >#70#return; 1839216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839213#factFINAL assume true; 1839204#factEXIT >#78#return; 1839209#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1839251#$Ultimate##0 ~n := #in~n; 1839260#L25 assume ~n <= 0;#res := 1; 1839256#factFINAL assume true; 1839250#factEXIT >#80#return; 1839241#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1839244#$Ultimate##0 ~n := #in~n; 1839322#L25 assume !(~n <= 0); 1839318#L26 call #t~ret0 := fact(~n - 1);< 1839321#$Ultimate##0 ~n := #in~n; 1839615#L25 assume !(~n <= 0); 1839316#L26 call #t~ret0 := fact(~n - 1);< 1839407#$Ultimate##0 ~n := #in~n; 1839420#L25 assume !(~n <= 0); 1839317#L26 call #t~ret0 := fact(~n - 1);< 1839419#$Ultimate##0 ~n := #in~n; 1839422#L25 assume ~n <= 0;#res := 1; 1839421#factFINAL assume true; 1839418#factEXIT >#70#return; 1839416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839415#factFINAL assume true; 1839414#factEXIT >#70#return; 1839413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839412#factFINAL assume true; 1839315#factEXIT >#70#return; 1839313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839278#factFINAL assume true; 1839240#factEXIT >#82#return; 1839237#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1839230#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1839218#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839215#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839212#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1839202#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1839203#$Ultimate##0 ~n := #in~n; 1839408#L25 assume !(~n <= 0); 1839319#L26 call #t~ret0 := fact(~n - 1);< 1839407#$Ultimate##0 ~n := #in~n; 1839420#L25 assume !(~n <= 0); 1839317#L26 call #t~ret0 := fact(~n - 1);< 1839419#$Ultimate##0 ~n := #in~n; 1839420#L25 assume !(~n <= 0); 1839317#L26 call #t~ret0 := fact(~n - 1);< 1839419#$Ultimate##0 ~n := #in~n; 1839420#L25 assume !(~n <= 0); 1839317#L26 call #t~ret0 := fact(~n - 1);< 1839419#$Ultimate##0 ~n := #in~n; 1839422#L25 assume ~n <= 0;#res := 1; 1839421#factFINAL assume true; 1839418#factEXIT >#70#return; 1839416#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839415#factFINAL assume true; 1839414#factEXIT >#70#return; 1839413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839412#factFINAL assume true; 1839315#factEXIT >#70#return; 1839320#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839417#factFINAL assume true; 1839406#factEXIT >#70#return; 1839405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839403#factFINAL assume true; 1839200#factEXIT >#78#return; 1839152#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1839154#$Ultimate##0 ~n := #in~n; 1839160#L25 assume ~n <= 0;#res := 1; 1839159#factFINAL assume true; 1839151#factEXIT >#80#return; 1839150#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1839148#$Ultimate##0 ~n := #in~n; 1839195#L25 assume !(~n <= 0); 1839186#L26 call #t~ret0 := fact(~n - 1);< 1839193#$Ultimate##0 ~n := #in~n; 1839423#L25 assume !(~n <= 0); 1839185#L26 call #t~ret0 := fact(~n - 1);< 1839194#$Ultimate##0 ~n := #in~n; 1839191#L25 assume !(~n <= 0); 1839178#L26 call #t~ret0 := fact(~n - 1);< 1839179#$Ultimate##0 ~n := #in~n; 1839190#L25 assume !(~n <= 0); 1839177#L26 call #t~ret0 := fact(~n - 1);< 1839188#$Ultimate##0 ~n := #in~n; 1839309#L25 assume ~n <= 0;#res := 1; 1839306#factFINAL assume true; 1839303#factEXIT >#70#return; 1839300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839296#factFINAL assume true; 1839290#factEXIT >#70#return; 1839286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839282#factFINAL assume true; 1839269#factEXIT >#70#return; 1839270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839192#factFINAL assume true; 1839184#factEXIT >#70#return; 1839155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839156#factFINAL assume true; 1839198#factEXIT >#82#return; 1839146#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1839174#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1839172#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839170#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839169#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1839134#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1839135#$Ultimate##0 ~n := #in~n; 1839180#L25 assume !(~n <= 0); 1839176#L26 call #t~ret0 := fact(~n - 1);< 1839179#$Ultimate##0 ~n := #in~n; 1839190#L25 assume !(~n <= 0); 1839177#L26 call #t~ret0 := fact(~n - 1);< 1839188#$Ultimate##0 ~n := #in~n; 1839190#L25 assume !(~n <= 0); 1839177#L26 call #t~ret0 := fact(~n - 1);< 1839188#$Ultimate##0 ~n := #in~n; 1839190#L25 assume !(~n <= 0); 1839177#L26 call #t~ret0 := fact(~n - 1);< 1839188#$Ultimate##0 ~n := #in~n; 1839190#L25 assume !(~n <= 0); 1839177#L26 call #t~ret0 := fact(~n - 1);< 1839188#$Ultimate##0 ~n := #in~n; 1839309#L25 assume ~n <= 0;#res := 1; 1839306#factFINAL assume true; 1839303#factEXIT >#70#return; 1839300#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839296#factFINAL assume true; 1839290#factEXIT >#70#return; 1839286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839282#factFINAL assume true; 1839269#factEXIT >#70#return; 1839270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839192#factFINAL assume true; 1839184#factEXIT >#70#return; 1839182#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839181#factFINAL assume true; 1839175#factEXIT >#70#return; 1839173#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839171#factFINAL assume true; 1839132#factEXIT >#78#return; 1839129#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1839130#$Ultimate##0 ~n := #in~n; 1839189#L25 assume ~n <= 0;#res := 1; 1839183#factFINAL assume true; 1839127#factEXIT >#80#return; 1839123#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1839125#$Ultimate##0 ~n := #in~n; 1839435#L25 assume !(~n <= 0); 1839429#L26 call #t~ret0 := fact(~n - 1);< 1839433#$Ultimate##0 ~n := #in~n; 1839447#L25 assume !(~n <= 0); 1839445#L26 call #t~ret0 := fact(~n - 1);< 1839446#$Ultimate##0 ~n := #in~n; 1839448#L25 assume !(~n <= 0); 1839430#L26 call #t~ret0 := fact(~n - 1);< 1839437#$Ultimate##0 ~n := #in~n; 1839442#L25 assume !(~n <= 0); 1839428#L26 call #t~ret0 := fact(~n - 1);< 1839441#$Ultimate##0 ~n := #in~n; 1839442#L25 assume !(~n <= 0); 1839428#L26 call #t~ret0 := fact(~n - 1);< 1839441#$Ultimate##0 ~n := #in~n; 1839471#L25 assume ~n <= 0;#res := 1; 1839470#factFINAL assume true; 1839469#factEXIT >#70#return; 1839467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839459#factFINAL assume true; 1839456#factEXIT >#70#return; 1839455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839454#factFINAL assume true; 1839452#factEXIT >#70#return; 1839450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839449#factFINAL assume true; 1839444#factEXIT >#70#return; 1839443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839440#factFINAL assume true; 1839427#factEXIT >#70#return; 1839425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839424#factFINAL assume true; 1839121#factEXIT >#82#return; 1839124#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1839138#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1839136#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839131#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839126#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1839113#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1839115#$Ultimate##0 ~n := #in~n; 1839438#L25 assume !(~n <= 0); 1839431#L26 call #t~ret0 := fact(~n - 1);< 1839437#$Ultimate##0 ~n := #in~n; 1839442#L25 assume !(~n <= 0); 1839428#L26 call #t~ret0 := fact(~n - 1);< 1839441#$Ultimate##0 ~n := #in~n; 1839442#L25 assume !(~n <= 0); 1839428#L26 call #t~ret0 := fact(~n - 1);< 1839441#$Ultimate##0 ~n := #in~n; 1839442#L25 assume !(~n <= 0); 1839428#L26 call #t~ret0 := fact(~n - 1);< 1839441#$Ultimate##0 ~n := #in~n; 1839442#L25 assume !(~n <= 0); 1839428#L26 call #t~ret0 := fact(~n - 1);< 1839441#$Ultimate##0 ~n := #in~n; 1839442#L25 assume !(~n <= 0); 1839428#L26 call #t~ret0 := fact(~n - 1);< 1839441#$Ultimate##0 ~n := #in~n; 1839471#L25 assume ~n <= 0;#res := 1; 1839470#factFINAL assume true; 1839469#factEXIT >#70#return; 1839467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839459#factFINAL assume true; 1839456#factEXIT >#70#return; 1839455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839454#factFINAL assume true; 1839452#factEXIT >#70#return; 1839450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839449#factFINAL assume true; 1839444#factEXIT >#70#return; 1839443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839440#factFINAL assume true; 1839427#factEXIT >#70#return; 1839432#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839439#factFINAL assume true; 1839436#factEXIT >#70#return; 1839434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839426#factFINAL assume true; 1839112#factEXIT >#78#return; 1839109#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1839111#$Ultimate##0 ~n := #in~n; 1839453#L25 assume ~n <= 0;#res := 1; 1839451#factFINAL assume true; 1839108#factEXIT >#80#return; 1839103#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1839106#$Ultimate##0 ~n := #in~n; 1839468#L25 assume !(~n <= 0); 1839462#L26 call #t~ret0 := fact(~n - 1);< 1839466#$Ultimate##0 ~n := #in~n; 1839483#L25 assume !(~n <= 0); 1839480#L26 call #t~ret0 := fact(~n - 1);< 1839481#$Ultimate##0 ~n := #in~n; 1839488#L25 assume !(~n <= 0); 1839484#L26 call #t~ret0 := fact(~n - 1);< 1839486#$Ultimate##0 ~n := #in~n; 1839485#L25 assume !(~n <= 0); 1839476#L26 call #t~ret0 := fact(~n - 1);< 1839482#$Ultimate##0 ~n := #in~n; 1839478#L25 assume !(~n <= 0); 1839461#L26 call #t~ret0 := fact(~n - 1);< 1839475#$Ultimate##0 ~n := #in~n; 1839474#L25 assume !(~n <= 0); 1839464#L26 call #t~ret0 := fact(~n - 1);< 1839473#$Ultimate##0 ~n := #in~n; 1839507#L25 assume ~n <= 0;#res := 1; 1839505#factFINAL assume true; 1839504#factEXIT >#70#return; 1839502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839501#factFINAL assume true; 1839499#factEXIT >#70#return; 1839498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839497#factFINAL assume true; 1839495#factEXIT >#70#return; 1839493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839491#factFINAL assume true; 1839490#factEXIT >#70#return; 1839489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839487#factFINAL assume true; 1839479#factEXIT >#70#return; 1839477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839472#factFINAL assume true; 1839460#factEXIT >#70#return; 1839458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839457#factFINAL assume true; 1839102#factEXIT >#82#return; 1839105#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1839107#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1839101#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839099#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839097#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1839090#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1839092#$Ultimate##0 ~n := #in~n; 1839496#L25 assume !(~n <= 0); 1839463#L26 call #t~ret0 := fact(~n - 1);< 1839475#$Ultimate##0 ~n := #in~n; 1839474#L25 assume !(~n <= 0); 1839464#L26 call #t~ret0 := fact(~n - 1);< 1839473#$Ultimate##0 ~n := #in~n; 1839474#L25 assume !(~n <= 0); 1839464#L26 call #t~ret0 := fact(~n - 1);< 1839473#$Ultimate##0 ~n := #in~n; 1839474#L25 assume !(~n <= 0); 1839464#L26 call #t~ret0 := fact(~n - 1);< 1839473#$Ultimate##0 ~n := #in~n; 1839474#L25 assume !(~n <= 0); 1839464#L26 call #t~ret0 := fact(~n - 1);< 1839473#$Ultimate##0 ~n := #in~n; 1839474#L25 assume !(~n <= 0); 1839464#L26 call #t~ret0 := fact(~n - 1);< 1839473#$Ultimate##0 ~n := #in~n; 1839474#L25 assume !(~n <= 0); 1839464#L26 call #t~ret0 := fact(~n - 1);< 1839473#$Ultimate##0 ~n := #in~n; 1839507#L25 assume ~n <= 0;#res := 1; 1839505#factFINAL assume true; 1839504#factEXIT >#70#return; 1839502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839501#factFINAL assume true; 1839499#factEXIT >#70#return; 1839498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839497#factFINAL assume true; 1839495#factEXIT >#70#return; 1839493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839491#factFINAL assume true; 1839490#factEXIT >#70#return; 1839489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839487#factFINAL assume true; 1839479#factEXIT >#70#return; 1839477#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839472#factFINAL assume true; 1839460#factEXIT >#70#return; 1839465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839500#factFINAL assume true; 1839494#factEXIT >#70#return; 1839492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839095#factFINAL assume true; 1839089#factEXIT >#78#return; 1839086#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1839088#$Ultimate##0 ~n := #in~n; 1839506#L25 assume ~n <= 0;#res := 1; 1839503#factFINAL assume true; 1839085#factEXIT >#80#return; 1836416#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1836420#$Ultimate##0 ~n := #in~n; 1836418#L25 assume !(~n <= 0); 1836386#L26 call #t~ret0 := fact(~n - 1);< 1836414#$Ultimate##0 ~n := #in~n; 1838004#L25 assume !(~n <= 0); 1836398#L26 call #t~ret0 := fact(~n - 1);< 1836422#$Ultimate##0 ~n := #in~n; 1836521#L25 assume !(~n <= 0); 1836401#L26 call #t~ret0 := fact(~n - 1);< 1836428#$Ultimate##0 ~n := #in~n; 1836490#L25 assume !(~n <= 0); 1836400#L26 call #t~ret0 := fact(~n - 1);< 1836457#$Ultimate##0 ~n := #in~n; 1836487#L25 assume !(~n <= 0); 1836395#L26 call #t~ret0 := fact(~n - 1);< 1836461#$Ultimate##0 ~n := #in~n; 1836482#L25 assume !(~n <= 0); 1836397#L26 call #t~ret0 := fact(~n - 1);< 1836469#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836479#L25 assume ~n <= 0;#res := 1; 1836478#factFINAL assume true; 1836475#factEXIT >#70#return; 1836474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836472#factFINAL assume true; 1836468#factEXIT >#70#return; 1836465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836463#factFINAL assume true; 1836460#factEXIT >#70#return; 1836459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836458#factFINAL assume true; 1836456#factEXIT >#70#return; 1836455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836454#factFINAL assume true; 1836427#factEXIT >#70#return; 1836425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836423#factFINAL assume true; 1836421#factEXIT >#70#return; 1836419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836415#factFINAL assume true; 1836412#factEXIT >#70#return; 1836413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1839509#factFINAL assume true; 1839082#factEXIT >#82#return; 1839083#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1839168#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1839167#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1839166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1839165#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1836368#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1836377#$Ultimate##0 ~n := #in~n; 1836406#L25 assume !(~n <= 0); 1836394#L26 call #t~ret0 := fact(~n - 1);< 1836405#$Ultimate##0 ~n := #in~n; 1836518#L25 assume !(~n <= 0); 1836392#L26 call #t~ret0 := fact(~n - 1);< 1836512#$Ultimate##0 ~n := #in~n; 1836511#L25 assume !(~n <= 0); 1836384#L26 call #t~ret0 := fact(~n - 1);< 1836494#$Ultimate##0 ~n := #in~n; 1836491#L25 assume !(~n <= 0); 1836387#L26 call #t~ret0 := fact(~n - 1);< 1836484#$Ultimate##0 ~n := #in~n; 1836483#L25 assume !(~n <= 0); 1836399#L26 call #t~ret0 := fact(~n - 1);< 1836469#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836479#L25 assume ~n <= 0;#res := 1; 1836478#factFINAL assume true; 1836475#factEXIT >#70#return; 1836474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836472#factFINAL assume true; 1836468#factEXIT >#70#return; 1836465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836463#factFINAL assume true; 1836460#factEXIT >#70#return; 1836459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836458#factFINAL assume true; 1836456#factEXIT >#70#return; 1836455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836454#factFINAL assume true; 1836427#factEXIT >#70#return; 1836425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836423#factFINAL assume true; 1836421#factEXIT >#70#return; 1836419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836415#factFINAL assume true; 1836412#factEXIT >#70#return; 1836411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836407#factFINAL assume true; 1836382#factEXIT >#70#return; 1836381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836378#factFINAL assume true; 1836366#factEXIT >#78#return; 1836374#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1836361#$Ultimate##0 ~n := #in~n; 1841579#L25 assume ~n <= 0;#res := 1; 1841577#factFINAL assume true; 1841576#factEXIT >#80#return; 1836507#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1836510#$Ultimate##0 ~n := #in~n; 1836509#L25 assume !(~n <= 0); 1836389#L26 call #t~ret0 := fact(~n - 1);< 1836503#$Ultimate##0 ~n := #in~n; 1836502#L25 assume !(~n <= 0); 1836383#L26 call #t~ret0 := fact(~n - 1);< 1836501#$Ultimate##0 ~n := #in~n; 1836500#L25 assume !(~n <= 0); 1836402#L26 call #t~ret0 := fact(~n - 1);< 1836499#$Ultimate##0 ~n := #in~n; 1836498#L25 assume !(~n <= 0); 1836391#L26 call #t~ret0 := fact(~n - 1);< 1836493#$Ultimate##0 ~n := #in~n; 1836489#L25 assume !(~n <= 0); 1836388#L26 call #t~ret0 := fact(~n - 1);< 1836488#$Ultimate##0 ~n := #in~n; 1836486#L25 assume !(~n <= 0); 1836396#L26 call #t~ret0 := fact(~n - 1);< 1836469#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836479#L25 assume ~n <= 0;#res := 1; 1836478#factFINAL assume true; 1836475#factEXIT >#70#return; 1836474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836472#factFINAL assume true; 1836468#factEXIT >#70#return; 1836465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836463#factFINAL assume true; 1836460#factEXIT >#70#return; 1836459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836458#factFINAL assume true; 1836456#factEXIT >#70#return; 1836455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836454#factFINAL assume true; 1836427#factEXIT >#70#return; 1836425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836423#factFINAL assume true; 1836421#factEXIT >#70#return; 1836419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836415#factFINAL assume true; 1836412#factEXIT >#70#return; 1836411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836407#factFINAL assume true; 1836382#factEXIT >#70#return; 1836404#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1841596#factFINAL assume true; 1841568#factEXIT >#82#return; 1841570#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1841605#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1840415#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1840055#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1840033#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1836369#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1836377#$Ultimate##0 ~n := #in~n; 1836406#L25 assume !(~n <= 0); 1836394#L26 call #t~ret0 := fact(~n - 1);< 1836405#$Ultimate##0 ~n := #in~n; 1836518#L25 assume !(~n <= 0); 1836392#L26 call #t~ret0 := fact(~n - 1);< 1836512#$Ultimate##0 ~n := #in~n; 1836511#L25 assume !(~n <= 0); 1836384#L26 call #t~ret0 := fact(~n - 1);< 1836494#$Ultimate##0 ~n := #in~n; 1836491#L25 assume !(~n <= 0); 1836387#L26 call #t~ret0 := fact(~n - 1);< 1836484#$Ultimate##0 ~n := #in~n; 1836483#L25 assume !(~n <= 0); 1836399#L26 call #t~ret0 := fact(~n - 1);< 1836469#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836479#L25 assume ~n <= 0;#res := 1; 1836478#factFINAL assume true; 1836475#factEXIT >#70#return; 1836474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836472#factFINAL assume true; 1836468#factEXIT >#70#return; 1836465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836463#factFINAL assume true; 1836460#factEXIT >#70#return; 1836459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836458#factFINAL assume true; 1836456#factEXIT >#70#return; 1836455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836454#factFINAL assume true; 1836427#factEXIT >#70#return; 1836425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836423#factFINAL assume true; 1836421#factEXIT >#70#return; 1836419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836415#factFINAL assume true; 1836412#factEXIT >#70#return; 1836411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836407#factFINAL assume true; 1836382#factEXIT >#70#return; 1836403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1841587#factFINAL assume true; 1841583#factEXIT >#70#return; 1841581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1841580#factFINAL assume true; 1841578#factEXIT >#78#return; 1840801#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840805#$Ultimate##0 ~n := #in~n; 1840847#L25 assume ~n <= 0;#res := 1; 1840846#factFINAL assume true; 1840800#factEXIT >#80#return; 1840170#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840708#$Ultimate##0 ~n := #in~n; 1840703#L25 assume !(~n <= 0); 1836408#L26 call #t~ret0 := fact(~n - 1);< 1840047#$Ultimate##0 ~n := #in~n; 1840035#L25 assume !(~n <= 0); 1836393#L26 call #t~ret0 := fact(~n - 1);< 1836410#$Ultimate##0 ~n := #in~n; 1840034#L25 assume !(~n <= 0); 1836385#L26 call #t~ret0 := fact(~n - 1);< 1836414#$Ultimate##0 ~n := #in~n; 1838004#L25 assume !(~n <= 0); 1836398#L26 call #t~ret0 := fact(~n - 1);< 1836422#$Ultimate##0 ~n := #in~n; 1836521#L25 assume !(~n <= 0); 1836401#L26 call #t~ret0 := fact(~n - 1);< 1836428#$Ultimate##0 ~n := #in~n; 1836490#L25 assume !(~n <= 0); 1836400#L26 call #t~ret0 := fact(~n - 1);< 1836457#$Ultimate##0 ~n := #in~n; 1836487#L25 assume !(~n <= 0); 1836395#L26 call #t~ret0 := fact(~n - 1);< 1836461#$Ultimate##0 ~n := #in~n; 1836482#L25 assume !(~n <= 0); 1836397#L26 call #t~ret0 := fact(~n - 1);< 1836469#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836479#L25 assume ~n <= 0;#res := 1; 1836478#factFINAL assume true; 1836475#factEXIT >#70#return; 1836474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836472#factFINAL assume true; 1836468#factEXIT >#70#return; 1836465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836463#factFINAL assume true; 1836460#factEXIT >#70#return; 1836459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836458#factFINAL assume true; 1836456#factEXIT >#70#return; 1836455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836454#factFINAL assume true; 1836427#factEXIT >#70#return; 1836425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836423#factFINAL assume true; 1836421#factEXIT >#70#return; 1836419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836415#factFINAL assume true; 1836412#factEXIT >#70#return; 1836411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836407#factFINAL assume true; 1836382#factEXIT >#70#return; 1836403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1841587#factFINAL assume true; 1841583#factEXIT >#70#return; 1841585#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1841592#factFINAL assume true; 1841574#factEXIT >#82#return; 1840056#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1840046#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1836836#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1836835#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1836833#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1836371#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1836377#$Ultimate##0 ~n := #in~n; 1836406#L25 assume !(~n <= 0); 1836394#L26 call #t~ret0 := fact(~n - 1);< 1836405#$Ultimate##0 ~n := #in~n; 1836518#L25 assume !(~n <= 0); 1836392#L26 call #t~ret0 := fact(~n - 1);< 1836512#$Ultimate##0 ~n := #in~n; 1836511#L25 assume !(~n <= 0); 1836384#L26 call #t~ret0 := fact(~n - 1);< 1836494#$Ultimate##0 ~n := #in~n; 1836491#L25 assume !(~n <= 0); 1836387#L26 call #t~ret0 := fact(~n - 1);< 1836484#$Ultimate##0 ~n := #in~n; 1836483#L25 assume !(~n <= 0); 1836399#L26 call #t~ret0 := fact(~n - 1);< 1836469#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836477#L25 assume !(~n <= 0); 1836390#L26 call #t~ret0 := fact(~n - 1);< 1836476#$Ultimate##0 ~n := #in~n; 1836479#L25 assume ~n <= 0;#res := 1; 1836478#factFINAL assume true; 1836475#factEXIT >#70#return; 1836474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836472#factFINAL assume true; 1836468#factEXIT >#70#return; 1836465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836463#factFINAL assume true; 1836460#factEXIT >#70#return; 1836459#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836458#factFINAL assume true; 1836456#factEXIT >#70#return; 1836455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836454#factFINAL assume true; 1836427#factEXIT >#70#return; 1836425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836423#factFINAL assume true; 1836421#factEXIT >#70#return; 1836419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836415#factFINAL assume true; 1836412#factEXIT >#70#return; 1836411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836407#factFINAL assume true; 1836382#factEXIT >#70#return; 1836381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836378#factFINAL assume true; 1836366#factEXIT >#78#return; 1836350#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1836364#$Ultimate##0 ~n := #in~n; 1836380#L25 assume ~n <= 0;#res := 1; 1836379#factFINAL assume true; 1836349#factEXIT >#80#return; 1824297#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1836346#$Ultimate##0 ~n := #in~n; 1836344#L25 assume !(~n <= 0); 1835874#L26 call #t~ret0 := fact(~n - 1);< 1836343#$Ultimate##0 ~n := #in~n; 1840032#L25 assume !(~n <= 0); 1835864#L26 call #t~ret0 := fact(~n - 1);< 1836348#$Ultimate##0 ~n := #in~n; 1838003#L25 assume !(~n <= 0); 1835869#L26 call #t~ret0 := fact(~n - 1);< 1836430#$Ultimate##0 ~n := #in~n; 1840057#L25 assume !(~n <= 0); 1835857#L26 call #t~ret0 := fact(~n - 1);< 1836438#$Ultimate##0 ~n := #in~n; 1837265#L25 assume !(~n <= 0); 1835867#L26 call #t~ret0 := fact(~n - 1);< 1836467#$Ultimate##0 ~n := #in~n; 1838796#L25 assume !(~n <= 0); 1835854#L26 call #t~ret0 := fact(~n - 1);< 1835943#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836516#L25 assume ~n <= 0;#res := 1; 1836513#factFINAL assume true; 1836496#factEXIT >#70#return; 1836495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836492#factFINAL assume true; 1836485#factEXIT >#70#return; 1836481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836480#factFINAL assume true; 1836473#factEXIT >#70#return; 1836471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836470#factFINAL assume true; 1836466#factEXIT >#70#return; 1836464#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836462#factFINAL assume true; 1836437#factEXIT >#70#return; 1836435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836433#factFINAL assume true; 1836429#factEXIT >#70#return; 1836426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836424#factFINAL assume true; 1836347#factEXIT >#70#return; 1836345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836342#factFINAL assume true; 1836335#factEXIT >#70#return; 1824296#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1824298#factFINAL assume true; 1836540#factEXIT >#82#return; 1834222#L30-8 [2023-11-29 01:21:34,432 INFO L750 eck$LassoCheckResult]: Loop: 1834222#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1834219#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1834040#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1833867#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1833866#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1824210#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1824211#$Ultimate##0 ~n := #in~n; 1835925#L25 assume !(~n <= 0); 1835896#L26 call #t~ret0 := fact(~n - 1);< 1835899#$Ultimate##0 ~n := #in~n; 1836049#L25 assume !(~n <= 0); 1835894#L26 call #t~ret0 := fact(~n - 1);< 1835910#$Ultimate##0 ~n := #in~n; 1835957#L25 assume !(~n <= 0); 1835895#L26 call #t~ret0 := fact(~n - 1);< 1835932#$Ultimate##0 ~n := #in~n; 1835948#L25 assume !(~n <= 0); 1835897#L26 call #t~ret0 := fact(~n - 1);< 1835941#$Ultimate##0 ~n := #in~n; 1839657#L25 assume !(~n <= 0); 1835860#L26 call #t~ret0 := fact(~n - 1);< 1835943#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836516#L25 assume ~n <= 0;#res := 1; 1836513#factFINAL assume true; 1836496#factEXIT >#70#return; 1836495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836492#factFINAL assume true; 1836485#factEXIT >#70#return; 1836481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836480#factFINAL assume true; 1836473#factEXIT >#70#return; 1836471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836470#factFINAL assume true; 1836466#factEXIT >#70#return; 1836464#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836462#factFINAL assume true; 1836437#factEXIT >#70#return; 1836435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836433#factFINAL assume true; 1836429#factEXIT >#70#return; 1836426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836424#factFINAL assume true; 1836347#factEXIT >#70#return; 1836345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836342#factFINAL assume true; 1836335#factEXIT >#70#return; 1836333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836330#factFINAL assume true; 1836327#factEXIT >#70#return; 1836326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836325#factFINAL assume true; 1836323#factEXIT >#70#return; 1836322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836321#factFINAL assume true; 1836319#factEXIT >#70#return; 1836318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836317#factFINAL assume true; 1836315#factEXIT >#70#return; 1836314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836312#factFINAL assume true; 1836310#factEXIT >#70#return; 1836309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836306#factFINAL assume true; 1836046#factEXIT >#70#return; 1835993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835990#factFINAL assume true; 1835987#factEXIT >#70#return; 1835986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835983#factFINAL assume true; 1835959#factEXIT >#70#return; 1835958#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835954#factFINAL assume true; 1835951#factEXIT >#70#return; 1835949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835947#factFINAL assume true; 1835848#factEXIT >#70#return; 1835880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835942#factFINAL assume true; 1835940#factEXIT >#70#return; 1835938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835935#factFINAL assume true; 1835931#factEXIT >#70#return; 1835929#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835927#factFINAL assume true; 1835924#factEXIT >#70#return; 1835898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835909#factFINAL assume true; 1835893#factEXIT >#70#return; 1835890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835840#factFINAL assume true; 1835836#factEXIT >#78#return; 1824309#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1824310#$Ultimate##0 ~n := #in~n; 1835846#L25 assume ~n <= 0;#res := 1; 1835844#factFINAL assume true; 1835843#factEXIT >#80#return; 1835837#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1835841#$Ultimate##0 ~n := #in~n; 1835886#L25 assume !(~n <= 0); 1835878#L26 call #t~ret0 := fact(~n - 1);< 1824275#$Ultimate##0 ~n := #in~n; 1836044#L25 assume !(~n <= 0); 1835875#L26 call #t~ret0 := fact(~n - 1);< 1835952#$Ultimate##0 ~n := #in~n; 1836045#L25 assume !(~n <= 0); 1835877#L26 call #t~ret0 := fact(~n - 1);< 1835960#$Ultimate##0 ~n := #in~n; 1836284#L25 assume !(~n <= 0); 1835873#L26 call #t~ret0 := fact(~n - 1);< 1835989#$Ultimate##0 ~n := #in~n; 1837689#L25 assume !(~n <= 0); 1835858#L26 call #t~ret0 := fact(~n - 1);< 1836047#$Ultimate##0 ~n := #in~n; 1840044#L25 assume !(~n <= 0); 1835868#L26 call #t~ret0 := fact(~n - 1);< 1836311#$Ultimate##0 ~n := #in~n; 1840053#L25 assume !(~n <= 0); 1835851#L26 call #t~ret0 := fact(~n - 1);< 1836316#$Ultimate##0 ~n := #in~n; 1840362#L25 assume !(~n <= 0); 1835872#L26 call #t~ret0 := fact(~n - 1);< 1836320#$Ultimate##0 ~n := #in~n; 1837708#L25 assume !(~n <= 0); 1835856#L26 call #t~ret0 := fact(~n - 1);< 1836324#$Ultimate##0 ~n := #in~n; 1838601#L25 assume !(~n <= 0); 1835861#L26 call #t~ret0 := fact(~n - 1);< 1836329#$Ultimate##0 ~n := #in~n; 1836803#L25 assume !(~n <= 0); 1835853#L26 call #t~ret0 := fact(~n - 1);< 1836336#$Ultimate##0 ~n := #in~n; 1837692#L25 assume !(~n <= 0); 1835865#L26 call #t~ret0 := fact(~n - 1);< 1837691#$Ultimate##0 ~n := #in~n; 1837690#L25 assume !(~n <= 0); 1835879#L26 call #t~ret0 := fact(~n - 1);< 1837496#$Ultimate##0 ~n := #in~n; 1836524#L25 assume !(~n <= 0); 1835859#L26 call #t~ret0 := fact(~n - 1);< 1836523#$Ultimate##0 ~n := #in~n; 1836522#L25 assume !(~n <= 0); 1835876#L26 call #t~ret0 := fact(~n - 1);< 1836520#$Ultimate##0 ~n := #in~n; 1836519#L25 assume !(~n <= 0); 1835855#L26 call #t~ret0 := fact(~n - 1);< 1836517#$Ultimate##0 ~n := #in~n; 1836515#L25 assume !(~n <= 0); 1835871#L26 call #t~ret0 := fact(~n - 1);< 1835943#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836514#L25 assume !(~n <= 0); 1835849#L26 call #t~ret0 := fact(~n - 1);< 1836497#$Ultimate##0 ~n := #in~n; 1836516#L25 assume ~n <= 0;#res := 1; 1836513#factFINAL assume true; 1836496#factEXIT >#70#return; 1836495#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836492#factFINAL assume true; 1836485#factEXIT >#70#return; 1836481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836480#factFINAL assume true; 1836473#factEXIT >#70#return; 1836471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836470#factFINAL assume true; 1836466#factEXIT >#70#return; 1836464#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836462#factFINAL assume true; 1836437#factEXIT >#70#return; 1836435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836433#factFINAL assume true; 1836429#factEXIT >#70#return; 1836426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836424#factFINAL assume true; 1836347#factEXIT >#70#return; 1836345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836342#factFINAL assume true; 1836335#factEXIT >#70#return; 1836333#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836330#factFINAL assume true; 1836327#factEXIT >#70#return; 1836326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836325#factFINAL assume true; 1836323#factEXIT >#70#return; 1836322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836321#factFINAL assume true; 1836319#factEXIT >#70#return; 1836318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836317#factFINAL assume true; 1836315#factEXIT >#70#return; 1836314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836312#factFINAL assume true; 1836310#factEXIT >#70#return; 1836309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1836306#factFINAL assume true; 1836046#factEXIT >#70#return; 1835993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835990#factFINAL assume true; 1835987#factEXIT >#70#return; 1835986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835983#factFINAL assume true; 1835959#factEXIT >#70#return; 1835958#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835954#factFINAL assume true; 1835951#factEXIT >#70#return; 1835949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835947#factFINAL assume true; 1835848#factEXIT >#70#return; 1835880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835942#factFINAL assume true; 1835940#factEXIT >#70#return; 1835938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835935#factFINAL assume true; 1835931#factEXIT >#70#return; 1835929#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835927#factFINAL assume true; 1835924#factEXIT >#70#return; 1835898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835909#factFINAL assume true; 1835893#factEXIT >#70#return; 1835890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1835840#factFINAL assume true; 1835836#factEXIT >#82#return; 1834222#L30-8 [2023-11-29 01:21:34,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash 184132998, now seen corresponding path program 30 times [2023-11-29 01:21:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:21:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383279011] [2023-11-29 01:21:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:21:34,498 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:21:34,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521489613] [2023-11-29 01:21:34,498 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 01:21:34,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:21:34,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:34,500 INFO L229 MonitoredProcess]: Starting monitored process 599 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:21:34,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (599)] Waiting until timeout for monitored process [2023-11-29 01:21:36,695 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2023-11-29 01:21:36,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:21:36,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 01:21:36,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 49856 backedges. 8166 proven. 1628 refuted. 0 times theorem prover too weak. 40062 trivial. 0 not checked. [2023-11-29 01:21:37,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:21:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 49856 backedges. 8169 proven. 1738 refuted. 0 times theorem prover too weak. 39949 trivial. 0 not checked. [2023-11-29 01:21:43,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:21:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383279011] [2023-11-29 01:21:43,300 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:21:43,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521489613] [2023-11-29 01:21:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521489613] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:21:43,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:21:43,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 40] total 45 [2023-11-29 01:21:43,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222405745] [2023-11-29 01:21:43,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:21:43,302 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:21:43,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -345945092, now seen corresponding path program 31 times [2023-11-29 01:21:43,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:21:43,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305541299] [2023-11-29 01:21:43,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:21:43,338 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:21:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004486959] [2023-11-29 01:21:43,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:21:43,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:21:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:43,339 INFO L229 MonitoredProcess]: Starting monitored process 600 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:21:43,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (600)] Waiting until timeout for monitored process [2023-11-29 01:21:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:21:45,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:21:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:21:50,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:21:53,181 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:21:53,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:21:53,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:21:53,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:21:53,182 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:21:53,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:21:53,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:21:53,182 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration65_Loop [2023-11-29 01:21:53,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:21:53,182 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:21:53,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,287 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:21:53,287 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:21:53,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,289 INFO L229 MonitoredProcess]: Starting monitored process 601 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (601)] Waiting until timeout for monitored process [2023-11-29 01:21:53,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,302 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,302 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=22} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (601)] Ended with exit code 0 [2023-11-29 01:21:53,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,306 INFO L229 MonitoredProcess]: Starting monitored process 602 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (602)] Waiting until timeout for monitored process [2023-11-29 01:21:53,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,319 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,320 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (602)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,323 INFO L229 MonitoredProcess]: Starting monitored process 603 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (603)] Waiting until timeout for monitored process [2023-11-29 01:21:53,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,337 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,337 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (603)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,341 INFO L229 MonitoredProcess]: Starting monitored process 604 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (604)] Waiting until timeout for monitored process [2023-11-29 01:21:53,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,355 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,355 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (604)] Ended with exit code 0 [2023-11-29 01:21:53,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,359 INFO L229 MonitoredProcess]: Starting monitored process 605 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (605)] Waiting until timeout for monitored process [2023-11-29 01:21:53,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,378 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=22} Honda state: {ULTIMATE.start_main_~x~0#1=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (605)] Ended with exit code 0 [2023-11-29 01:21:53,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,382 INFO L229 MonitoredProcess]: Starting monitored process 606 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (606)] Waiting until timeout for monitored process [2023-11-29 01:21:53,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,397 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,397 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1124000727777607680000} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=1124000727777607680000} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (606)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,401 INFO L229 MonitoredProcess]: Starting monitored process 607 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (607)] Waiting until timeout for monitored process [2023-11-29 01:21:53,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,415 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,415 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (607)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,419 INFO L229 MonitoredProcess]: Starting monitored process 608 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (608)] Waiting until timeout for monitored process [2023-11-29 01:21:53,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,432 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,433 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: [] [2023-11-29 01:21:53,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (608)] Ended with exit code 0 [2023-11-29 01:21:53,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,436 INFO L229 MonitoredProcess]: Starting monitored process 609 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (609)] Waiting until timeout for monitored process [2023-11-29 01:21:53,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,450 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,450 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=22} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (609)] Ended with exit code 0 [2023-11-29 01:21:53,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,454 INFO L229 MonitoredProcess]: Starting monitored process 610 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (610)] Waiting until timeout for monitored process [2023-11-29 01:21:53,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,468 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,469 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1124000727777607680000} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1124000727777607680000} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (610)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,472 INFO L229 MonitoredProcess]: Starting monitored process 611 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (611)] Waiting until timeout for monitored process [2023-11-29 01:21:53,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (611)] Ended with exit code 0 [2023-11-29 01:21:53,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,490 INFO L229 MonitoredProcess]: Starting monitored process 612 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (612)] Waiting until timeout for monitored process [2023-11-29 01:21:53,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:21:53,503 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:21:53,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (612)] Ended with exit code 0 [2023-11-29 01:21:53,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,507 INFO L229 MonitoredProcess]: Starting monitored process 613 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (613)] Waiting until timeout for monitored process [2023-11-29 01:21:53,509 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:21:53,509 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (613)] Ended with exit code 0 [2023-11-29 01:21:53,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,524 INFO L229 MonitoredProcess]: Starting monitored process 614 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (614)] Waiting until timeout for monitored process [2023-11-29 01:21:53,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:21:53,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:21:53,539 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:21:53,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (614)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,542 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:21:53,542 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:21:53,542 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:21:53,542 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:21:53,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:21:53,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:21:53,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:21:53,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration65_Loop [2023-11-29 01:21:53,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:21:53,543 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:21:53,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:21:53,651 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:21:53,651 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:21:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,652 INFO L229 MonitoredProcess]: Starting monitored process 615 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (615)] Waiting until timeout for monitored process [2023-11-29 01:21:53,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (615)] Ended with exit code 0 [2023-11-29 01:21:53,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,671 INFO L229 MonitoredProcess]: Starting monitored process 616 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (616)] Waiting until timeout for monitored process [2023-11-29 01:21:53,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (616)] Ended with exit code 0 [2023-11-29 01:21:53,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,688 INFO L229 MonitoredProcess]: Starting monitored process 617 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (617)] Waiting until timeout for monitored process [2023-11-29 01:21:53,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (617)] Ended with exit code 0 [2023-11-29 01:21:53,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,706 INFO L229 MonitoredProcess]: Starting monitored process 618 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (618)] Waiting until timeout for monitored process [2023-11-29 01:21:53,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (618)] Ended with exit code 0 [2023-11-29 01:21:53,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,723 INFO L229 MonitoredProcess]: Starting monitored process 619 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (619)] Waiting until timeout for monitored process [2023-11-29 01:21:53,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (619)] Ended with exit code 0 [2023-11-29 01:21:53,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,740 INFO L229 MonitoredProcess]: Starting monitored process 620 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (620)] Waiting until timeout for monitored process [2023-11-29 01:21:53,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (620)] Ended with exit code 0 [2023-11-29 01:21:53,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,759 INFO L229 MonitoredProcess]: Starting monitored process 621 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (621)] Waiting until timeout for monitored process [2023-11-29 01:21:53,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (621)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,777 INFO L229 MonitoredProcess]: Starting monitored process 622 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (622)] Waiting until timeout for monitored process [2023-11-29 01:21:53,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (622)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,796 INFO L229 MonitoredProcess]: Starting monitored process 623 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (623)] Waiting until timeout for monitored process [2023-11-29 01:21:53,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (623)] Forceful destruction successful, exit code 0 [2023-11-29 01:21:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,815 INFO L229 MonitoredProcess]: Starting monitored process 624 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (624)] Waiting until timeout for monitored process [2023-11-29 01:21:53,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (624)] Ended with exit code 0 [2023-11-29 01:21:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,832 INFO L229 MonitoredProcess]: Starting monitored process 625 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (625)] Waiting until timeout for monitored process [2023-11-29 01:21:53,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (625)] Ended with exit code 0 [2023-11-29 01:21:53,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,850 INFO L229 MonitoredProcess]: Starting monitored process 626 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (626)] Waiting until timeout for monitored process [2023-11-29 01:21:53,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:21:53,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (626)] Ended with exit code 0 [2023-11-29 01:21:53,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,867 INFO L229 MonitoredProcess]: Starting monitored process 627 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (627)] Waiting until timeout for monitored process [2023-11-29 01:21:53,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:21:53,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:21:53,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:21:53,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:21:53,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:21:53,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:21:53,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:21:53,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:21:53,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:21:53,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:21:53,884 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:21:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:21:53,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:53,886 INFO L229 MonitoredProcess]: Starting monitored process 628 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:21:53,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (628)] Waiting until timeout for monitored process [2023-11-29 01:21:53,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:21:53,888 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:21:53,888 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:21:53,888 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 43 Supporting invariants [] [2023-11-29 01:21:53,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (627)] Ended with exit code 0 [2023-11-29 01:21:53,890 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:21:53,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:54,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 5731 conjuncts, 280 conjunts are in the unsatisfiable core [2023-11-29 01:21:54,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:21:55,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (628)] Ended with exit code 0 [2023-11-29 01:22:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:01,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 146 conjunts are in the unsatisfiable core [2023-11-29 01:22:01,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 3361 refuted. 0 times theorem prover too weak. 2855 trivial. 0 not checked. [2023-11-29 01:22:02,406 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 29 loop predicates [2023-11-29 01:22:02,406 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20090 states and 66655 transitions. cyclomatic complexity: 46669 Second operand has 32 states, 30 states have (on average 2.533333333333333) internal successors, (76), 30 states have internal predecessors, (76), 6 states have call successors, (12), 2 states have call predecessors, (12), 25 states have return successors, (34), 27 states have call predecessors, (34), 6 states have call successors, (34) [2023-11-29 01:22:04,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20090 states and 66655 transitions. cyclomatic complexity: 46669. Second operand has 32 states, 30 states have (on average 2.533333333333333) internal successors, (76), 30 states have internal predecessors, (76), 6 states have call successors, (12), 2 states have call predecessors, (12), 25 states have return successors, (34), 27 states have call predecessors, (34), 6 states have call successors, (34) Result 42251 states and 108967 transitions. Complement of second has 161 states. [2023-11-29 01:22:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 31 states 2 stem states 28 non-accepting loop states 1 accepting loop states [2023-11-29 01:22:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 2.533333333333333) internal successors, (76), 30 states have internal predecessors, (76), 6 states have call successors, (12), 2 states have call predecessors, (12), 25 states have return successors, (34), 27 states have call predecessors, (34), 6 states have call successors, (34) [2023-11-29 01:22:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 172 transitions. [2023-11-29 01:22:04,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 172 transitions. Stem has 858 letters. Loop has 284 letters. [2023-11-29 01:22:04,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:22:04,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 172 transitions. Stem has 1142 letters. Loop has 284 letters. [2023-11-29 01:22:04,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:22:04,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 172 transitions. Stem has 858 letters. Loop has 568 letters. [2023-11-29 01:22:04,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:22:04,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42251 states and 108967 transitions. [2023-11-29 01:22:04,744 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2304 [2023-11-29 01:22:05,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42251 states to 27475 states and 78266 transitions. [2023-11-29 01:22:05,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6989 [2023-11-29 01:22:05,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7004 [2023-11-29 01:22:05,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27475 states and 78266 transitions. [2023-11-29 01:22:05,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:22:05,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27475 states and 78266 transitions. [2023-11-29 01:22:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27475 states and 78266 transitions. [2023-11-29 01:22:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27475 to 20788. [2023-11-29 01:22:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20788 states, 11252 states have (on average 1.0379488091006044) internal successors, (11679), 11169 states have internal predecessors, (11679), 7558 states have call successors, (8324), 2009 states have call predecessors, (8324), 1978 states have return successors, (49308), 7609 states have call predecessors, (49308), 7558 states have call successors, (49308) [2023-11-29 01:22:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20788 states to 20788 states and 69311 transitions. [2023-11-29 01:22:06,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20788 states and 69311 transitions. [2023-11-29 01:22:06,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:06,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 01:22:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1807, Unknown=0, NotChecked=0, Total=2070 [2023-11-29 01:22:06,449 INFO L87 Difference]: Start difference. First operand 20788 states and 69311 transitions. Second operand has 46 states, 41 states have (on average 2.658536585365854) internal successors, (109), 45 states have internal predecessors, (109), 25 states have call successors, (43), 1 states have call predecessors, (43), 18 states have return successors, (56), 25 states have call predecessors, (56), 25 states have call successors, (56) [2023-11-29 01:22:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:09,943 INFO L93 Difference]: Finished difference Result 25721 states and 96258 transitions. [2023-11-29 01:22:09,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25721 states and 96258 transitions. [2023-11-29 01:22:10,436 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2458 [2023-11-29 01:22:11,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25721 states to 25570 states and 95337 transitions. [2023-11-29 01:22:11,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7241 [2023-11-29 01:22:11,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7244 [2023-11-29 01:22:11,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25570 states and 95337 transitions. [2023-11-29 01:22:11,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:22:11,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25570 states and 95337 transitions. [2023-11-29 01:22:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25570 states and 95337 transitions. [2023-11-29 01:22:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25570 to 21095. [2023-11-29 01:22:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21095 states, 11456 states have (on average 1.0385824022346368) internal successors, (11898), 11372 states have internal predecessors, (11898), 7661 states have call successors, (8427), 2074 states have call predecessors, (8427), 1978 states have return successors, (50103), 7648 states have call predecessors, (50103), 7661 states have call successors, (50103) [2023-11-29 01:22:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21095 states to 21095 states and 70428 transitions. [2023-11-29 01:22:12,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21095 states and 70428 transitions. [2023-11-29 01:22:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 01:22:12,709 INFO L428 stractBuchiCegarLoop]: Abstraction has 21095 states and 70428 transitions. [2023-11-29 01:22:12,709 INFO L335 stractBuchiCegarLoop]: ======== Iteration 66 ============ [2023-11-29 01:22:12,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21095 states and 70428 transitions. [2023-11-29 01:22:12,837 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2341 [2023-11-29 01:22:12,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:22:12,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:22:12,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [140, 140, 107, 107, 107, 107, 33, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:12,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [49, 49, 46, 46, 46, 46, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:12,840 INFO L748 eck$LassoCheckResult]: Stem: 1942349#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1942300#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1942301#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1942317#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1942350#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1942956#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1948372#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1948350#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1948351#$Ultimate##0 ~n := #in~n; 1948371#L25 assume ~n <= 0;#res := 1; 1948370#factFINAL assume true; 1948349#factEXIT >#72#return; 1947847#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1947848#$Ultimate##0 ~n := #in~n; 1947853#L25 assume ~n <= 0;#res := 1; 1947852#factFINAL assume true; 1947846#factEXIT >#74#return; 1947738#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1947739#$Ultimate##0 ~n := #in~n; 1947845#L25 assume ~n <= 0;#res := 1; 1947758#factFINAL assume true; 1947737#factEXIT >#76#return; 1947734#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1947732#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1947733#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1954480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1954478#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1954474#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1954475#$Ultimate##0 ~n := #in~n; 1954485#L25 assume !(~n <= 0); 1954482#L26 call #t~ret0 := fact(~n - 1);< 1954483#$Ultimate##0 ~n := #in~n; 1954486#L25 assume ~n <= 0;#res := 1; 1954484#factFINAL assume true; 1954481#factEXIT >#70#return; 1954479#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954477#factFINAL assume true; 1954473#factEXIT >#78#return; 1954470#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1954471#$Ultimate##0 ~n := #in~n; 1954476#L25 assume ~n <= 0;#res := 1; 1954472#factFINAL assume true; 1954469#factEXIT >#80#return; 1954465#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954466#$Ultimate##0 ~n := #in~n; 1956044#L25 assume !(~n <= 0); 1956041#L26 call #t~ret0 := fact(~n - 1);< 1956043#$Ultimate##0 ~n := #in~n; 1956053#L25 assume ~n <= 0;#res := 1; 1956054#factFINAL assume true; 1956040#factEXIT >#70#return; 1956039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1956037#factFINAL assume true; 1954464#factEXIT >#82#return; 1954460#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1954455#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1954453#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1954451#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1954450#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1954448#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1954449#$Ultimate##0 ~n := #in~n; 1954461#L25 assume !(~n <= 0); 1954458#L26 call #t~ret0 := fact(~n - 1);< 1954459#$Ultimate##0 ~n := #in~n; 1954511#L25 assume !(~n <= 0); 1954457#L26 call #t~ret0 := fact(~n - 1);< 1954508#$Ultimate##0 ~n := #in~n; 1954512#L25 assume ~n <= 0;#res := 1; 1954510#factFINAL assume true; 1954507#factEXIT >#70#return; 1954463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954462#factFINAL assume true; 1954456#factEXIT >#70#return; 1954454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954452#factFINAL assume true; 1954447#factEXIT >#78#return; 1954443#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1954444#$Ultimate##0 ~n := #in~n; 1954446#L25 assume ~n <= 0;#res := 1; 1954445#factFINAL assume true; 1954442#factEXIT >#80#return; 1954432#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954437#$Ultimate##0 ~n := #in~n; 1954434#L25 assume !(~n <= 0); 1954417#L26 call #t~ret0 := fact(~n - 1);< 1954422#$Ultimate##0 ~n := #in~n; 1954439#L25 assume !(~n <= 0); 1954415#L26 call #t~ret0 := fact(~n - 1);< 1954436#$Ultimate##0 ~n := #in~n; 1954441#L25 assume ~n <= 0;#res := 1; 1954438#factFINAL assume true; 1954435#factEXIT >#70#return; 1954433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954431#factFINAL assume true; 1954429#factEXIT >#70#return; 1954430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1958570#factFINAL assume true; 1958569#factEXIT >#82#return; 1958568#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1958567#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1958566#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1958565#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1958564#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1954396#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1954400#$Ultimate##0 ~n := #in~n; 1954427#L25 assume !(~n <= 0); 1954414#L26 call #t~ret0 := fact(~n - 1);< 1954422#$Ultimate##0 ~n := #in~n; 1954439#L25 assume !(~n <= 0); 1954415#L26 call #t~ret0 := fact(~n - 1);< 1954436#$Ultimate##0 ~n := #in~n; 1954439#L25 assume !(~n <= 0); 1954415#L26 call #t~ret0 := fact(~n - 1);< 1954436#$Ultimate##0 ~n := #in~n; 1954441#L25 assume ~n <= 0;#res := 1; 1954438#factFINAL assume true; 1954435#factEXIT >#70#return; 1954433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954431#factFINAL assume true; 1954429#factEXIT >#70#return; 1954428#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954423#factFINAL assume true; 1954413#factEXIT >#70#return; 1954412#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954409#factFINAL assume true; 1954393#factEXIT >#78#return; 1954399#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1954500#$Ultimate##0 ~n := #in~n; 1954503#L25 assume ~n <= 0;#res := 1; 1954502#factFINAL assume true; 1954498#factEXIT >#80#return; 1954370#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954376#$Ultimate##0 ~n := #in~n; 1954374#L25 assume !(~n <= 0); 1954364#L26 call #t~ret0 := fact(~n - 1);< 1954371#$Ultimate##0 ~n := #in~n; 1954407#L25 assume !(~n <= 0); 1954363#L26 call #t~ret0 := fact(~n - 1);< 1954367#$Ultimate##0 ~n := #in~n; 1954386#L25 assume !(~n <= 0); 1954362#L26 call #t~ret0 := fact(~n - 1);< 1954383#$Ultimate##0 ~n := #in~n; 1954385#L25 assume ~n <= 0;#res := 1; 1954384#factFINAL assume true; 1954382#factEXIT >#70#return; 1954381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954380#factFINAL assume true; 1954379#factEXIT >#70#return; 1954378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954377#factFINAL assume true; 1954375#factEXIT >#70#return; 1954366#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954520#factFINAL assume true; 1954513#factEXIT >#82#return; 1954514#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1958574#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1958573#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1958572#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1958571#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1954356#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1954358#$Ultimate##0 ~n := #in~n; 1954372#L25 assume !(~n <= 0); 1954365#L26 call #t~ret0 := fact(~n - 1);< 1954367#$Ultimate##0 ~n := #in~n; 1954386#L25 assume !(~n <= 0); 1954362#L26 call #t~ret0 := fact(~n - 1);< 1954383#$Ultimate##0 ~n := #in~n; 1954386#L25 assume !(~n <= 0); 1954362#L26 call #t~ret0 := fact(~n - 1);< 1954383#$Ultimate##0 ~n := #in~n; 1954386#L25 assume !(~n <= 0); 1954362#L26 call #t~ret0 := fact(~n - 1);< 1954383#$Ultimate##0 ~n := #in~n; 1954385#L25 assume ~n <= 0;#res := 1; 1954384#factFINAL assume true; 1954382#factEXIT >#70#return; 1954381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954380#factFINAL assume true; 1954379#factEXIT >#70#return; 1954378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954377#factFINAL assume true; 1954375#factEXIT >#70#return; 1954373#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954368#factFINAL assume true; 1954361#factEXIT >#70#return; 1954360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954359#factFINAL assume true; 1954355#factEXIT >#78#return; 1954350#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1954352#$Ultimate##0 ~n := #in~n; 1954354#L25 assume ~n <= 0;#res := 1; 1954353#factFINAL assume true; 1954349#factEXIT >#80#return; 1954325#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954340#$Ultimate##0 ~n := #in~n; 1954337#L25 assume !(~n <= 0); 1954321#L26 call #t~ret0 := fact(~n - 1);< 1954327#$Ultimate##0 ~n := #in~n; 1954344#L25 assume !(~n <= 0); 1954319#L26 call #t~ret0 := fact(~n - 1);< 1954332#$Ultimate##0 ~n := #in~n; 1954343#L25 assume !(~n <= 0); 1954311#L26 call #t~ret0 := fact(~n - 1);< 1954314#$Ultimate##0 ~n := #in~n; 1954328#L25 assume !(~n <= 0); 1954313#L26 call #t~ret0 := fact(~n - 1);< 1954323#$Ultimate##0 ~n := #in~n; 1954348#L25 assume ~n <= 0;#res := 1; 1954347#factFINAL assume true; 1954346#factEXIT >#70#return; 1954345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954342#factFINAL assume true; 1954339#factEXIT >#70#return; 1954336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954333#factFINAL assume true; 1954330#factEXIT >#70#return; 1954329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954324#factFINAL assume true; 1954318#factEXIT >#70#return; 1954322#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954531#factFINAL assume true; 1954528#factEXIT >#82#return; 1954529#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1958514#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1958513#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1958512#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1958511#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1954305#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1954307#$Ultimate##0 ~n := #in~n; 1954316#L25 assume !(~n <= 0); 1954312#L26 call #t~ret0 := fact(~n - 1);< 1954314#$Ultimate##0 ~n := #in~n; 1954328#L25 assume !(~n <= 0); 1954313#L26 call #t~ret0 := fact(~n - 1);< 1954323#$Ultimate##0 ~n := #in~n; 1954328#L25 assume !(~n <= 0); 1954313#L26 call #t~ret0 := fact(~n - 1);< 1954323#$Ultimate##0 ~n := #in~n; 1954328#L25 assume !(~n <= 0); 1954313#L26 call #t~ret0 := fact(~n - 1);< 1954323#$Ultimate##0 ~n := #in~n; 1954328#L25 assume !(~n <= 0); 1954313#L26 call #t~ret0 := fact(~n - 1);< 1954323#$Ultimate##0 ~n := #in~n; 1954348#L25 assume ~n <= 0;#res := 1; 1954347#factFINAL assume true; 1954346#factEXIT >#70#return; 1954345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954342#factFINAL assume true; 1954339#factEXIT >#70#return; 1954336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954333#factFINAL assume true; 1954330#factEXIT >#70#return; 1954329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954324#factFINAL assume true; 1954318#factEXIT >#70#return; 1954317#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954315#factFINAL assume true; 1954310#factEXIT >#70#return; 1954309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954308#factFINAL assume true; 1954304#factEXIT >#78#return; 1954296#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1954298#$Ultimate##0 ~n := #in~n; 1954300#L25 assume ~n <= 0;#res := 1; 1954299#factFINAL assume true; 1954295#factEXIT >#80#return; 1954270#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954279#$Ultimate##0 ~n := #in~n; 1954275#L25 assume !(~n <= 0); 1954266#L26 call #t~ret0 := fact(~n - 1);< 1954272#$Ultimate##0 ~n := #in~n; 1954281#L25 assume !(~n <= 0); 1954277#L26 call #t~ret0 := fact(~n - 1);< 1954278#$Ultimate##0 ~n := #in~n; 1954285#L25 assume !(~n <= 0); 1954259#L26 call #t~ret0 := fact(~n - 1);< 1954261#$Ultimate##0 ~n := #in~n; 1954273#L25 assume !(~n <= 0); 1954258#L26 call #t~ret0 := fact(~n - 1);< 1954268#$Ultimate##0 ~n := #in~n; 1954273#L25 assume !(~n <= 0); 1954258#L26 call #t~ret0 := fact(~n - 1);< 1954268#$Ultimate##0 ~n := #in~n; 1954292#L25 assume ~n <= 0;#res := 1; 1954291#factFINAL assume true; 1954290#factEXIT >#70#return; 1954289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954288#factFINAL assume true; 1954287#factEXIT >#70#return; 1954286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954284#factFINAL assume true; 1954283#factEXIT >#70#return; 1954282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954280#factFINAL assume true; 1954276#factEXIT >#70#return; 1954274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954269#factFINAL assume true; 1954265#factEXIT >#70#return; 1954267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954488#factFINAL assume true; 1954467#factEXIT >#82#return; 1954468#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1958510#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1958509#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1958508#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1958507#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1954252#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1954254#$Ultimate##0 ~n := #in~n; 1954263#L25 assume !(~n <= 0); 1954260#L26 call #t~ret0 := fact(~n - 1);< 1954261#$Ultimate##0 ~n := #in~n; 1954273#L25 assume !(~n <= 0); 1954258#L26 call #t~ret0 := fact(~n - 1);< 1954268#$Ultimate##0 ~n := #in~n; 1954273#L25 assume !(~n <= 0); 1954258#L26 call #t~ret0 := fact(~n - 1);< 1954268#$Ultimate##0 ~n := #in~n; 1954273#L25 assume !(~n <= 0); 1954258#L26 call #t~ret0 := fact(~n - 1);< 1954268#$Ultimate##0 ~n := #in~n; 1954273#L25 assume !(~n <= 0); 1954258#L26 call #t~ret0 := fact(~n - 1);< 1954268#$Ultimate##0 ~n := #in~n; 1954273#L25 assume !(~n <= 0); 1954258#L26 call #t~ret0 := fact(~n - 1);< 1954268#$Ultimate##0 ~n := #in~n; 1954292#L25 assume ~n <= 0;#res := 1; 1954291#factFINAL assume true; 1954290#factEXIT >#70#return; 1954289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954288#factFINAL assume true; 1954287#factEXIT >#70#return; 1954286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954284#factFINAL assume true; 1954283#factEXIT >#70#return; 1954282#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954280#factFINAL assume true; 1954276#factEXIT >#70#return; 1954274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954269#factFINAL assume true; 1954265#factEXIT >#70#return; 1954264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954262#factFINAL assume true; 1954257#factEXIT >#70#return; 1954256#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954255#factFINAL assume true; 1954251#factEXIT >#78#return; 1954244#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1954246#$Ultimate##0 ~n := #in~n; 1954248#L25 assume ~n <= 0;#res := 1; 1954247#factFINAL assume true; 1954243#factEXIT >#80#return; 1954202#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954210#$Ultimate##0 ~n := #in~n; 1954206#L25 assume !(~n <= 0); 1954197#L26 call #t~ret0 := fact(~n - 1);< 1954203#$Ultimate##0 ~n := #in~n; 1954212#L25 assume !(~n <= 0); 1954208#L26 call #t~ret0 := fact(~n - 1);< 1954209#$Ultimate##0 ~n := #in~n; 1954218#L25 assume !(~n <= 0); 1954215#L26 call #t~ret0 := fact(~n - 1);< 1954216#$Ultimate##0 ~n := #in~n; 1954224#L25 assume !(~n <= 0); 1954221#L26 call #t~ret0 := fact(~n - 1);< 1954222#$Ultimate##0 ~n := #in~n; 1954228#L25 assume !(~n <= 0); 1954190#L26 call #t~ret0 := fact(~n - 1);< 1954192#$Ultimate##0 ~n := #in~n; 1954204#L25 assume !(~n <= 0); 1954189#L26 call #t~ret0 := fact(~n - 1);< 1954199#$Ultimate##0 ~n := #in~n; 1954232#L25 assume ~n <= 0;#res := 1; 1954231#factFINAL assume true; 1954230#factEXIT >#70#return; 1954229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954227#factFINAL assume true; 1954226#factEXIT >#70#return; 1954225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954223#factFINAL assume true; 1954220#factEXIT >#70#return; 1954219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954217#factFINAL assume true; 1954214#factEXIT >#70#return; 1954213#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954211#factFINAL assume true; 1954207#factEXIT >#70#return; 1954205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954200#factFINAL assume true; 1954196#factEXIT >#70#return; 1954198#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954535#factFINAL assume true; 1954533#factEXIT >#82#return; 1954534#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1958506#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1958505#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1958504#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1958503#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1954183#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1954185#$Ultimate##0 ~n := #in~n; 1954194#L25 assume !(~n <= 0); 1954191#L26 call #t~ret0 := fact(~n - 1);< 1954192#$Ultimate##0 ~n := #in~n; 1954204#L25 assume !(~n <= 0); 1954189#L26 call #t~ret0 := fact(~n - 1);< 1954199#$Ultimate##0 ~n := #in~n; 1954204#L25 assume !(~n <= 0); 1954189#L26 call #t~ret0 := fact(~n - 1);< 1954199#$Ultimate##0 ~n := #in~n; 1954204#L25 assume !(~n <= 0); 1954189#L26 call #t~ret0 := fact(~n - 1);< 1954199#$Ultimate##0 ~n := #in~n; 1954204#L25 assume !(~n <= 0); 1954189#L26 call #t~ret0 := fact(~n - 1);< 1954199#$Ultimate##0 ~n := #in~n; 1954204#L25 assume !(~n <= 0); 1954189#L26 call #t~ret0 := fact(~n - 1);< 1954199#$Ultimate##0 ~n := #in~n; 1954204#L25 assume !(~n <= 0); 1954189#L26 call #t~ret0 := fact(~n - 1);< 1954199#$Ultimate##0 ~n := #in~n; 1954232#L25 assume ~n <= 0;#res := 1; 1954231#factFINAL assume true; 1954230#factEXIT >#70#return; 1954229#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954227#factFINAL assume true; 1954226#factEXIT >#70#return; 1954225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954223#factFINAL assume true; 1954220#factEXIT >#70#return; 1954219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954217#factFINAL assume true; 1954214#factEXIT >#70#return; 1954213#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954211#factFINAL assume true; 1954207#factEXIT >#70#return; 1954205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954200#factFINAL assume true; 1954196#factEXIT >#70#return; 1954195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954193#factFINAL assume true; 1954188#factEXIT >#70#return; 1954187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954186#factFINAL assume true; 1954182#factEXIT >#78#return; 1954127#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1954128#$Ultimate##0 ~n := #in~n; 1954133#L25 assume ~n <= 0;#res := 1; 1954131#factFINAL assume true; 1954125#factEXIT >#80#return; 1954052#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954062#$Ultimate##0 ~n := #in~n; 1954056#L25 assume !(~n <= 0); 1954015#L26 call #t~ret0 := fact(~n - 1);< 1954049#$Ultimate##0 ~n := #in~n; 1955686#L25 assume !(~n <= 0); 1954013#L26 call #t~ret0 := fact(~n - 1);< 1954061#$Ultimate##0 ~n := #in~n; 1955467#L25 assume !(~n <= 0); 1954009#L26 call #t~ret0 := fact(~n - 1);< 1954072#$Ultimate##0 ~n := #in~n; 1955690#L25 assume !(~n <= 0); 1954011#L26 call #t~ret0 := fact(~n - 1);< 1954079#$Ultimate##0 ~n := #in~n; 1954119#L25 assume !(~n <= 0); 1954007#L26 call #t~ret0 := fact(~n - 1);< 1954118#$Ultimate##0 ~n := #in~n; 1954116#L25 assume !(~n <= 0); 1954028#L26 call #t~ret0 := fact(~n - 1);< 1954085#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954115#L25 assume ~n <= 0;#res := 1; 1954114#factFINAL assume true; 1954091#factEXIT >#70#return; 1954090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954089#factFINAL assume true; 1954088#factEXIT >#70#return; 1954087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954086#factFINAL assume true; 1954084#factEXIT >#70#return; 1954083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954081#factFINAL assume true; 1954077#factEXIT >#70#return; 1954076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954075#factFINAL assume true; 1954070#factEXIT >#70#return; 1954068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954065#factFINAL assume true; 1954058#factEXIT >#70#return; 1954055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954051#factFINAL assume true; 1954046#factEXIT >#70#return; 1954048#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954113#factFINAL assume true; 1954111#factEXIT >#82#return; 1954112#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1958502#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1958501#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1958500#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1958499#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1953981#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1953987#$Ultimate##0 ~n := #in~n; 1954032#L25 assume !(~n <= 0); 1954025#L26 call #t~ret0 := fact(~n - 1);< 1954031#$Ultimate##0 ~n := #in~n; 1954163#L25 assume !(~n <= 0); 1954022#L26 call #t~ret0 := fact(~n - 1);< 1954160#$Ultimate##0 ~n := #in~n; 1954156#L25 assume !(~n <= 0); 1954018#L26 call #t~ret0 := fact(~n - 1);< 1954153#$Ultimate##0 ~n := #in~n; 1954151#L25 assume !(~n <= 0); 1954019#L26 call #t~ret0 := fact(~n - 1);< 1954148#$Ultimate##0 ~n := #in~n; 1954145#L25 assume !(~n <= 0); 1954016#L26 call #t~ret0 := fact(~n - 1);< 1954085#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954115#L25 assume ~n <= 0;#res := 1; 1954114#factFINAL assume true; 1954091#factEXIT >#70#return; 1954090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954089#factFINAL assume true; 1954088#factEXIT >#70#return; 1954087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954086#factFINAL assume true; 1954084#factEXIT >#70#return; 1954083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954081#factFINAL assume true; 1954077#factEXIT >#70#return; 1954076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954075#factFINAL assume true; 1954070#factEXIT >#70#return; 1954068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954065#factFINAL assume true; 1954058#factEXIT >#70#return; 1954055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954051#factFINAL assume true; 1954046#factEXIT >#70#return; 1954044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954039#factFINAL assume true; 1954006#factEXIT >#70#return; 1954004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954001#factFINAL assume true; 1953976#factEXIT >#78#return; 1953986#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1953968#$Ultimate##0 ~n := #in~n; 1954103#L25 assume ~n <= 0;#res := 1; 1954102#factFINAL assume true; 1954098#factEXIT >#80#return; 1954064#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1954069#$Ultimate##0 ~n := #in~n; 1954067#L25 assume !(~n <= 0); 1954024#L26 call #t~ret0 := fact(~n - 1);< 1954057#$Ultimate##0 ~n := #in~n; 1954054#L25 assume !(~n <= 0); 1954047#L26 call #t~ret0 := fact(~n - 1);< 1954050#$Ultimate##0 ~n := #in~n; 1954066#L25 assume !(~n <= 0); 1954059#L26 call #t~ret0 := fact(~n - 1);< 1954060#$Ultimate##0 ~n := #in~n; 1954074#L25 assume !(~n <= 0); 1954071#L26 call #t~ret0 := fact(~n - 1);< 1954073#$Ultimate##0 ~n := #in~n; 1954082#L25 assume !(~n <= 0); 1954078#L26 call #t~ret0 := fact(~n - 1);< 1954080#$Ultimate##0 ~n := #in~n; 1954138#L25 assume !(~n <= 0); 1954026#L26 call #t~ret0 := fact(~n - 1);< 1954085#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954115#L25 assume ~n <= 0;#res := 1; 1954114#factFINAL assume true; 1954091#factEXIT >#70#return; 1954090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954089#factFINAL assume true; 1954088#factEXIT >#70#return; 1954087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954086#factFINAL assume true; 1954084#factEXIT >#70#return; 1954083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954081#factFINAL assume true; 1954077#factEXIT >#70#return; 1954076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954075#factFINAL assume true; 1954070#factEXIT >#70#return; 1954068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954065#factFINAL assume true; 1954058#factEXIT >#70#return; 1954055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954051#factFINAL assume true; 1954046#factEXIT >#70#return; 1954044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954039#factFINAL assume true; 1954006#factEXIT >#70#return; 1954030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954410#factFINAL assume true; 1954403#factEXIT >#82#return; 1954302#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1954293#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1954250#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1954242#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1954233#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1953979#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1953987#$Ultimate##0 ~n := #in~n; 1954032#L25 assume !(~n <= 0); 1954025#L26 call #t~ret0 := fact(~n - 1);< 1954031#$Ultimate##0 ~n := #in~n; 1954163#L25 assume !(~n <= 0); 1954022#L26 call #t~ret0 := fact(~n - 1);< 1954160#$Ultimate##0 ~n := #in~n; 1954156#L25 assume !(~n <= 0); 1954018#L26 call #t~ret0 := fact(~n - 1);< 1954153#$Ultimate##0 ~n := #in~n; 1954151#L25 assume !(~n <= 0); 1954019#L26 call #t~ret0 := fact(~n - 1);< 1954148#$Ultimate##0 ~n := #in~n; 1954145#L25 assume !(~n <= 0); 1954016#L26 call #t~ret0 := fact(~n - 1);< 1954085#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954115#L25 assume ~n <= 0;#res := 1; 1954114#factFINAL assume true; 1954091#factEXIT >#70#return; 1954090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954089#factFINAL assume true; 1954088#factEXIT >#70#return; 1954087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954086#factFINAL assume true; 1954084#factEXIT >#70#return; 1954083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954081#factFINAL assume true; 1954077#factEXIT >#70#return; 1954076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954075#factFINAL assume true; 1954070#factEXIT >#70#return; 1954068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954065#factFINAL assume true; 1954058#factEXIT >#70#return; 1954055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954051#factFINAL assume true; 1954046#factEXIT >#70#return; 1954044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954039#factFINAL assume true; 1954006#factEXIT >#70#return; 1954029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1962670#factFINAL assume true; 1955367#factEXIT >#70#return; 1955370#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1962631#factFINAL assume true; 1962610#factEXIT >#78#return; 1962603#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1962606#$Ultimate##0 ~n := #in~n; 1962630#L25 assume ~n <= 0;#res := 1; 1962609#factFINAL assume true; 1962601#factEXIT >#80#return; 1955357#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1962593#$Ultimate##0 ~n := #in~n; 1958427#L25 assume !(~n <= 0); 1954042#L26 call #t~ret0 := fact(~n - 1);< 1958422#$Ultimate##0 ~n := #in~n; 1956230#L25 assume !(~n <= 0); 1954023#L26 call #t~ret0 := fact(~n - 1);< 1954041#$Ultimate##0 ~n := #in~n; 1955592#L25 assume !(~n <= 0); 1954021#L26 call #t~ret0 := fact(~n - 1);< 1954049#$Ultimate##0 ~n := #in~n; 1955686#L25 assume !(~n <= 0); 1954013#L26 call #t~ret0 := fact(~n - 1);< 1954061#$Ultimate##0 ~n := #in~n; 1955467#L25 assume !(~n <= 0); 1954009#L26 call #t~ret0 := fact(~n - 1);< 1954072#$Ultimate##0 ~n := #in~n; 1955690#L25 assume !(~n <= 0); 1954011#L26 call #t~ret0 := fact(~n - 1);< 1954079#$Ultimate##0 ~n := #in~n; 1954119#L25 assume !(~n <= 0); 1954007#L26 call #t~ret0 := fact(~n - 1);< 1954118#$Ultimate##0 ~n := #in~n; 1954116#L25 assume !(~n <= 0); 1954028#L26 call #t~ret0 := fact(~n - 1);< 1954085#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954115#L25 assume ~n <= 0;#res := 1; 1954114#factFINAL assume true; 1954091#factEXIT >#70#return; 1954090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954089#factFINAL assume true; 1954088#factEXIT >#70#return; 1954087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954086#factFINAL assume true; 1954084#factEXIT >#70#return; 1954083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954081#factFINAL assume true; 1954077#factEXIT >#70#return; 1954076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954075#factFINAL assume true; 1954070#factEXIT >#70#return; 1954068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954065#factFINAL assume true; 1954058#factEXIT >#70#return; 1954055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954051#factFINAL assume true; 1954046#factEXIT >#70#return; 1954044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954039#factFINAL assume true; 1954006#factEXIT >#70#return; 1954029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1962670#factFINAL assume true; 1955367#factEXIT >#70#return; 1955371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1962607#factFINAL assume true; 1955356#factEXIT >#82#return; 1955355#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1962821#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1962820#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1962818#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1962817#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1953980#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1953987#$Ultimate##0 ~n := #in~n; 1954032#L25 assume !(~n <= 0); 1954025#L26 call #t~ret0 := fact(~n - 1);< 1954031#$Ultimate##0 ~n := #in~n; 1954163#L25 assume !(~n <= 0); 1954022#L26 call #t~ret0 := fact(~n - 1);< 1954160#$Ultimate##0 ~n := #in~n; 1954156#L25 assume !(~n <= 0); 1954018#L26 call #t~ret0 := fact(~n - 1);< 1954153#$Ultimate##0 ~n := #in~n; 1954151#L25 assume !(~n <= 0); 1954019#L26 call #t~ret0 := fact(~n - 1);< 1954148#$Ultimate##0 ~n := #in~n; 1954145#L25 assume !(~n <= 0); 1954016#L26 call #t~ret0 := fact(~n - 1);< 1954085#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954097#L25 assume !(~n <= 0); 1954027#L26 call #t~ret0 := fact(~n - 1);< 1954092#$Ultimate##0 ~n := #in~n; 1954115#L25 assume ~n <= 0;#res := 1; 1954114#factFINAL assume true; 1954091#factEXIT >#70#return; 1954090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954089#factFINAL assume true; 1954088#factEXIT >#70#return; 1954087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954086#factFINAL assume true; 1954084#factEXIT >#70#return; 1954083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954081#factFINAL assume true; 1954077#factEXIT >#70#return; 1954076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954075#factFINAL assume true; 1954070#factEXIT >#70#return; 1954068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954065#factFINAL assume true; 1954058#factEXIT >#70#return; 1954055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954051#factFINAL assume true; 1954046#factEXIT >#70#return; 1954044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954039#factFINAL assume true; 1954006#factEXIT >#70#return; 1954004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1954001#factFINAL assume true; 1953976#factEXIT >#78#return; 1953954#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1953962#$Ultimate##0 ~n := #in~n; 1955398#L25 assume ~n <= 0;#res := 1; 1955397#factFINAL assume true; 1955308#factEXIT >#80#return; 1952918#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1952919#$Ultimate##0 ~n := #in~n; 1955466#L25 assume !(~n <= 0); 1953128#L26 call #t~ret0 := fact(~n - 1);< 1953464#$Ultimate##0 ~n := #in~n; 1955410#L25 assume !(~n <= 0); 1953140#L26 call #t~ret0 := fact(~n - 1);< 1955409#$Ultimate##0 ~n := #in~n; 1955408#L25 assume !(~n <= 0); 1953156#L26 call #t~ret0 := fact(~n - 1);< 1955407#$Ultimate##0 ~n := #in~n; 1955406#L25 assume !(~n <= 0); 1953133#L26 call #t~ret0 := fact(~n - 1);< 1955401#$Ultimate##0 ~n := #in~n; 1955400#L25 assume !(~n <= 0); 1953144#L26 call #t~ret0 := fact(~n - 1);< 1955396#$Ultimate##0 ~n := #in~n; 1955395#L25 assume !(~n <= 0); 1953149#L26 call #t~ret0 := fact(~n - 1);< 1955390#$Ultimate##0 ~n := #in~n; 1955387#L25 assume !(~n <= 0); 1953138#L26 call #t~ret0 := fact(~n - 1);< 1953244#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953781#L25 assume ~n <= 0;#res := 1; 1953780#factFINAL assume true; 1953777#factEXIT >#70#return; 1953776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953775#factFINAL assume true; 1953774#factEXIT >#70#return; 1953771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953769#factFINAL assume true; 1953747#factEXIT >#70#return; 1953745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953744#factFINAL assume true; 1953740#factEXIT >#70#return; 1953738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953699#factFINAL assume true; 1953658#factEXIT >#70#return; 1953657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953654#factFINAL assume true; 1953613#factEXIT >#70#return; 1953612#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953609#factFINAL assume true; 1953530#factEXIT >#70#return; 1953529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953524#factFINAL assume true; 1953467#factEXIT >#70#return; 1953466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953463#factFINAL assume true; 1953456#factEXIT >#70#return; 1953159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1955235#factFINAL assume true; 1954982#factEXIT >#82#return; 1952904#L30-8 [2023-11-29 01:22:12,840 INFO L750 eck$LassoCheckResult]: Loop: 1952904#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1952903#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1952722#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1952534#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1952469#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1941970#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1941971#$Ultimate##0 ~n := #in~n; 1953642#L25 assume !(~n <= 0); 1953136#L26 call #t~ret0 := fact(~n - 1);< 1953165#$Ultimate##0 ~n := #in~n; 1953752#L25 assume !(~n <= 0); 1953151#L26 call #t~ret0 := fact(~n - 1);< 1953184#$Ultimate##0 ~n := #in~n; 1955125#L25 assume !(~n <= 0); 1953146#L26 call #t~ret0 := fact(~n - 1);< 1953227#$Ultimate##0 ~n := #in~n; 1953248#L25 assume !(~n <= 0); 1953154#L26 call #t~ret0 := fact(~n - 1);< 1953235#$Ultimate##0 ~n := #in~n; 1953264#L25 assume !(~n <= 0); 1953141#L26 call #t~ret0 := fact(~n - 1);< 1953244#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953781#L25 assume ~n <= 0;#res := 1; 1953780#factFINAL assume true; 1953777#factEXIT >#70#return; 1953776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953775#factFINAL assume true; 1953774#factEXIT >#70#return; 1953771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953769#factFINAL assume true; 1953747#factEXIT >#70#return; 1953745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953744#factFINAL assume true; 1953740#factEXIT >#70#return; 1953738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953699#factFINAL assume true; 1953658#factEXIT >#70#return; 1953657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953654#factFINAL assume true; 1953613#factEXIT >#70#return; 1953612#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953609#factFINAL assume true; 1953530#factEXIT >#70#return; 1953529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953524#factFINAL assume true; 1953467#factEXIT >#70#return; 1953466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953463#factFINAL assume true; 1953456#factEXIT >#70#return; 1953454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953452#factFINAL assume true; 1953397#factEXIT >#70#return; 1953390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953385#factFINAL assume true; 1953380#factEXIT >#70#return; 1953379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953378#factFINAL assume true; 1953376#factEXIT >#70#return; 1953375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953371#factFINAL assume true; 1953359#factEXIT >#70#return; 1953352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953287#factFINAL assume true; 1953273#factEXIT >#70#return; 1953272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953268#factFINAL assume true; 1953265#factEXIT >#70#return; 1953263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953260#factFINAL assume true; 1953258#factEXIT >#70#return; 1953257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953254#factFINAL assume true; 1953253#factEXIT >#70#return; 1953252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953251#factFINAL assume true; 1953249#factEXIT >#70#return; 1953247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953246#factFINAL assume true; 1953243#factEXIT >#70#return; 1953240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953239#factFINAL assume true; 1953234#factEXIT >#70#return; 1953233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953232#factFINAL assume true; 1953226#factEXIT >#70#return; 1953224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953218#factFINAL assume true; 1953202#factEXIT >#70#return; 1953158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953183#factFINAL assume true; 1953122#factEXIT >#70#return; 1953112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953105#factFINAL assume true; 1953101#factEXIT >#78#return; 1942344#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1942345#$Ultimate##0 ~n := #in~n; 1953186#L25 assume ~n <= 0;#res := 1; 1953166#factFINAL assume true; 1953113#factEXIT >#80#return; 1952917#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1953106#$Ultimate##0 ~n := #in~n; 1953228#L25 assume !(~n <= 0); 1953147#L26 call #t~ret0 := fact(~n - 1);< 1942308#$Ultimate##0 ~n := #in~n; 1953782#L25 assume !(~n <= 0); 1953157#L26 call #t~ret0 := fact(~n - 1);< 1953250#$Ultimate##0 ~n := #in~n; 1953853#L25 assume !(~n <= 0); 1953127#L26 call #t~ret0 := fact(~n - 1);< 1953259#$Ultimate##0 ~n := #in~n; 1955910#L25 assume !(~n <= 0); 1953143#L26 call #t~ret0 := fact(~n - 1);< 1953267#$Ultimate##0 ~n := #in~n; 1956038#L25 assume !(~n <= 0); 1953135#L26 call #t~ret0 := fact(~n - 1);< 1953274#$Ultimate##0 ~n := #in~n; 1958439#L25 assume !(~n <= 0); 1953126#L26 call #t~ret0 := fact(~n - 1);< 1953360#$Ultimate##0 ~n := #in~n; 1958432#L25 assume !(~n <= 0); 1953124#L26 call #t~ret0 := fact(~n - 1);< 1953377#$Ultimate##0 ~n := #in~n; 1958448#L25 assume !(~n <= 0); 1953134#L26 call #t~ret0 := fact(~n - 1);< 1953381#$Ultimate##0 ~n := #in~n; 1958446#L25 assume !(~n <= 0); 1953129#L26 call #t~ret0 := fact(~n - 1);< 1953398#$Ultimate##0 ~n := #in~n; 1956176#L25 assume !(~n <= 0); 1953131#L26 call #t~ret0 := fact(~n - 1);< 1953458#$Ultimate##0 ~n := #in~n; 1942341#L25 assume !(~n <= 0); 1953123#L26 call #t~ret0 := fact(~n - 1);< 1953468#$Ultimate##0 ~n := #in~n; 1956239#L25 assume !(~n <= 0); 1953130#L26 call #t~ret0 := fact(~n - 1);< 1953531#$Ultimate##0 ~n := #in~n; 1956250#L25 assume !(~n <= 0); 1953125#L26 call #t~ret0 := fact(~n - 1);< 1953614#$Ultimate##0 ~n := #in~n; 1956227#L25 assume !(~n <= 0); 1953150#L26 call #t~ret0 := fact(~n - 1);< 1953659#$Ultimate##0 ~n := #in~n; 1956034#L25 assume !(~n <= 0); 1953139#L26 call #t~ret0 := fact(~n - 1);< 1953741#$Ultimate##0 ~n := #in~n; 1954141#L25 assume !(~n <= 0); 1953145#L26 call #t~ret0 := fact(~n - 1);< 1953894#$Ultimate##0 ~n := #in~n; 1953855#L25 assume !(~n <= 0); 1953153#L26 call #t~ret0 := fact(~n - 1);< 1953244#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953779#L25 assume !(~n <= 0); 1953142#L26 call #t~ret0 := fact(~n - 1);< 1953778#$Ultimate##0 ~n := #in~n; 1953781#L25 assume ~n <= 0;#res := 1; 1953780#factFINAL assume true; 1953777#factEXIT >#70#return; 1953776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953775#factFINAL assume true; 1953774#factEXIT >#70#return; 1953771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953769#factFINAL assume true; 1953747#factEXIT >#70#return; 1953745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953744#factFINAL assume true; 1953740#factEXIT >#70#return; 1953738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953699#factFINAL assume true; 1953658#factEXIT >#70#return; 1953657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953654#factFINAL assume true; 1953613#factEXIT >#70#return; 1953612#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953609#factFINAL assume true; 1953530#factEXIT >#70#return; 1953529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953524#factFINAL assume true; 1953467#factEXIT >#70#return; 1953466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953463#factFINAL assume true; 1953456#factEXIT >#70#return; 1953454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953452#factFINAL assume true; 1953397#factEXIT >#70#return; 1953390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953385#factFINAL assume true; 1953380#factEXIT >#70#return; 1953379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953378#factFINAL assume true; 1953376#factEXIT >#70#return; 1953375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953371#factFINAL assume true; 1953359#factEXIT >#70#return; 1953352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953287#factFINAL assume true; 1953273#factEXIT >#70#return; 1953272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953268#factFINAL assume true; 1953265#factEXIT >#70#return; 1953263#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953260#factFINAL assume true; 1953258#factEXIT >#70#return; 1953257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953254#factFINAL assume true; 1953253#factEXIT >#70#return; 1953252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953251#factFINAL assume true; 1953249#factEXIT >#70#return; 1953247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953246#factFINAL assume true; 1953243#factEXIT >#70#return; 1953240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953239#factFINAL assume true; 1953234#factEXIT >#70#return; 1953233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953232#factFINAL assume true; 1953226#factEXIT >#70#return; 1953224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953218#factFINAL assume true; 1953202#factEXIT >#70#return; 1953158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953183#factFINAL assume true; 1953122#factEXIT >#70#return; 1953112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1953105#factFINAL assume true; 1953101#factEXIT >#82#return; 1952904#L30-8 [2023-11-29 01:22:12,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1866714298, now seen corresponding path program 31 times [2023-11-29 01:22:12,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:12,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25309706] [2023-11-29 01:22:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:12,890 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:22:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907572596] [2023-11-29 01:22:12,891 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 01:22:12,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:12,892 INFO L229 MonitoredProcess]: Starting monitored process 629 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:12,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (629)] Waiting until timeout for monitored process [2023-11-29 01:22:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:15,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 01:22:15,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 50624 backedges. 12473 proven. 109 refuted. 0 times theorem prover too weak. 38042 trivial. 0 not checked. [2023-11-29 01:22:15,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 50624 backedges. 5033 proven. 614 refuted. 0 times theorem prover too weak. 44977 trivial. 0 not checked. [2023-11-29 01:22:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:22:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25309706] [2023-11-29 01:22:19,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:22:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907572596] [2023-11-29 01:22:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907572596] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:22:19,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:22:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 35 [2023-11-29 01:22:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117322225] [2023-11-29 01:22:19,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:19,595 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 01:22:19,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash 852184700, now seen corresponding path program 32 times [2023-11-29 01:22:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126602660] [2023-11-29 01:22:19,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:19,635 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:22:19,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790663909] [2023-11-29 01:22:19,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:22:19,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:19,637 INFO L229 MonitoredProcess]: Starting monitored process 630 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:19,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (630)] Waiting until timeout for monitored process [2023-11-29 01:22:22,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:22:22,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:22:22,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:22:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:22:27,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:22:30,417 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:22:30,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:22:30,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:22:30,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:22:30,417 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 01:22:30,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:22:30,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:22:30,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration66_Loop [2023-11-29 01:22:30,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:22:30,418 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:22:30,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:22:30,536 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-29 01:22:30,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,552 INFO L229 MonitoredProcess]: Starting monitored process 631 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (631)] Waiting until timeout for monitored process [2023-11-29 01:22:30,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,565 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,565 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: [] [2023-11-29 01:22:30,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (631)] Ended with exit code 0 [2023-11-29 01:22:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,569 INFO L229 MonitoredProcess]: Starting monitored process 632 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (632)] Waiting until timeout for monitored process [2023-11-29 01:22:30,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,583 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (632)] Ended with exit code 0 [2023-11-29 01:22:30,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,587 INFO L229 MonitoredProcess]: Starting monitored process 633 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (633)] Waiting until timeout for monitored process [2023-11-29 01:22:30,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,601 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,601 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=25852016738884976640000} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=25852016738884976640000} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (633)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:30,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,605 INFO L229 MonitoredProcess]: Starting monitored process 634 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (634)] Waiting until timeout for monitored process [2023-11-29 01:22:30,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,619 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,619 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#in~k#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (634)] Ended with exit code 0 [2023-11-29 01:22:30,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,624 INFO L229 MonitoredProcess]: Starting monitored process 635 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (635)] Waiting until timeout for monitored process [2023-11-29 01:22:30,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,637 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (635)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:30,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,641 INFO L229 MonitoredProcess]: Starting monitored process 636 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (636)] Waiting until timeout for monitored process [2023-11-29 01:22:30,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,643 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,655 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,655 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_~n#1=23} Honda state: {ULTIMATE.start_binomialCoefficient_~n#1=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (636)] Ended with exit code 0 [2023-11-29 01:22:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,659 INFO L229 MonitoredProcess]: Starting monitored process 637 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (637)] Waiting until timeout for monitored process [2023-11-29 01:22:30,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,674 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,675 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=25852016738884976640000} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=25852016738884976640000} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (637)] Ended with exit code 0 [2023-11-29 01:22:30,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,679 INFO L229 MonitoredProcess]: Starting monitored process 638 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (638)] Waiting until timeout for monitored process [2023-11-29 01:22:30,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,693 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,693 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#in~n#1=23} Honda state: {ULTIMATE.start_binomialCoefficient_#in~n#1=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (638)] Ended with exit code 0 [2023-11-29 01:22:30,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,697 INFO L229 MonitoredProcess]: Starting monitored process 639 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (639)] Waiting until timeout for monitored process [2023-11-29 01:22:30,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,711 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,711 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (639)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:30,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,715 INFO L229 MonitoredProcess]: Starting monitored process 640 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (640)] Waiting until timeout for monitored process [2023-11-29 01:22:30,717 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,718 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,736 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,736 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=23} Honda state: {ULTIMATE.start_main_~x~0#1=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (640)] Ended with exit code 0 [2023-11-29 01:22:30,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,740 INFO L229 MonitoredProcess]: Starting monitored process 641 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (641)] Waiting until timeout for monitored process [2023-11-29 01:22:30,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,754 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-29 01:22:30,754 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-29 01:22:30,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (641)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:30,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,758 INFO L229 MonitoredProcess]: Starting monitored process 642 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (642)] Waiting until timeout for monitored process [2023-11-29 01:22:30,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-29 01:22:30,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (642)] Ended with exit code 0 [2023-11-29 01:22:30,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,776 INFO L229 MonitoredProcess]: Starting monitored process 643 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (643)] Waiting until timeout for monitored process [2023-11-29 01:22:30,779 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-29 01:22:30,779 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-29 01:22:30,791 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-29 01:22:30,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (643)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:30,794 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 01:22:30,794 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 01:22:30,794 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 01:22:30,794 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 01:22:30,794 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 01:22:30,794 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,794 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 01:22:30,794 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 01:22:30,794 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration66_Loop [2023-11-29 01:22:30,794 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 01:22:30,795 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 01:22:30,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 01:22:30,925 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 01:22:30,925 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 01:22:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,927 INFO L229 MonitoredProcess]: Starting monitored process 644 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (644)] Waiting until timeout for monitored process [2023-11-29 01:22:30,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:30,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:30,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:30,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:30,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:30,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:30,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:30,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:30,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:30,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (644)] Ended with exit code 0 [2023-11-29 01:22:30,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,945 INFO L229 MonitoredProcess]: Starting monitored process 645 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (645)] Waiting until timeout for monitored process [2023-11-29 01:22:30,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 [2023-11-29 01:22:30,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:30,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:30,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:30,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:30,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:30,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:30,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:30,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:30,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (645)] Ended with exit code 0 [2023-11-29 01:22:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,963 INFO L229 MonitoredProcess]: Starting monitored process 646 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (646)] Waiting until timeout for monitored process [2023-11-29 01:22:30,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:30,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:30,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:30,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:30,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:30,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:30,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:30,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:30,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:30,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (646)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:30,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:30,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:30,983 INFO L229 MonitoredProcess]: Starting monitored process 647 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:30,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (647)] Waiting until timeout for monitored process [2023-11-29 01:22:30,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:30,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:30,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:30,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:30,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:30,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:30,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:30,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:30,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (647)] Ended with exit code 0 [2023-11-29 01:22:31,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,002 INFO L229 MonitoredProcess]: Starting monitored process 648 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (648)] Waiting until timeout for monitored process [2023-11-29 01:22:31,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:31,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (648)] Ended with exit code 0 [2023-11-29 01:22:31,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,019 INFO L229 MonitoredProcess]: Starting monitored process 649 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (649)] Waiting until timeout for monitored process [2023-11-29 01:22:31,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:31,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (649)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:31,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,038 INFO L229 MonitoredProcess]: Starting monitored process 650 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (650)] Waiting until timeout for monitored process [2023-11-29 01:22:31,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:31,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (650)] Ended with exit code 0 [2023-11-29 01:22:31,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,057 INFO L229 MonitoredProcess]: Starting monitored process 651 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (651)] Waiting until timeout for monitored process [2023-11-29 01:22:31,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 [2023-11-29 01:22:31,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (651)] Ended with exit code 0 [2023-11-29 01:22:31,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,075 INFO L229 MonitoredProcess]: Starting monitored process 652 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (652)] Waiting until timeout for monitored process [2023-11-29 01:22:31,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:31,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (652)] Ended with exit code 0 [2023-11-29 01:22:31,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,093 INFO L229 MonitoredProcess]: Starting monitored process 653 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (653)] Waiting until timeout for monitored process [2023-11-29 01:22:31,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:31,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (653)] Ended with exit code 0 [2023-11-29 01:22:31,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,111 INFO L229 MonitoredProcess]: Starting monitored process 654 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (654)] Waiting until timeout for monitored process [2023-11-29 01:22:31,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 [2023-11-29 01:22:31,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 01:22:31,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (654)] Ended with exit code 0 [2023-11-29 01:22:31,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,129 INFO L229 MonitoredProcess]: Starting monitored process 655 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (655)] Waiting until timeout for monitored process [2023-11-29 01:22:31,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 01:22:31,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 01:22:31,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 01:22:31,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 01:22:31,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 01:22:31,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 01:22:31,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 01:22:31,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 01:22:31,144 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 01:22:31,146 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-29 01:22:31,146 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-29 01:22:31,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 01:22:31,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:31,148 INFO L229 MonitoredProcess]: Starting monitored process 656 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 01:22:31,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (656)] Waiting until timeout for monitored process [2023-11-29 01:22:31,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 01:22:31,150 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-29 01:22:31,150 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 01:22:31,150 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 45 Supporting invariants [] [2023-11-29 01:22:31,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (655)] Ended with exit code 0 [2023-11-29 01:22:31,152 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-29 01:22:31,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:31,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (656)] Ended with exit code 0 [2023-11-29 01:22:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:31,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 5771 conjuncts, 282 conjunts are in the unsatisfiable core [2023-11-29 01:22:31,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:39,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 1977 conjuncts, 152 conjunts are in the unsatisfiable core [2023-11-29 01:22:39,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6774 backedges. 0 proven. 3663 refuted. 0 times theorem prover too weak. 3111 trivial. 0 not checked. [2023-11-29 01:22:40,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 30 loop predicates [2023-11-29 01:22:40,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21095 states and 70428 transitions. cyclomatic complexity: 49441 Second operand has 33 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 6 states have call successors, (12), 2 states have call predecessors, (12), 26 states have return successors, (35), 28 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-29 01:22:42,754 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21095 states and 70428 transitions. cyclomatic complexity: 49441. Second operand has 33 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 6 states have call successors, (12), 2 states have call predecessors, (12), 26 states have return successors, (35), 28 states have call predecessors, (35), 6 states have call successors, (35) Result 46336 states and 119025 transitions. Complement of second has 167 states. [2023-11-29 01:22:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 2 stem states 29 non-accepting loop states 1 accepting loop states [2023-11-29 01:22:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 6 states have call successors, (12), 2 states have call predecessors, (12), 26 states have return successors, (35), 28 states have call predecessors, (35), 6 states have call successors, (35) [2023-11-29 01:22:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 178 transitions. [2023-11-29 01:22:42,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 178 transitions. Stem has 864 letters. Loop has 296 letters. [2023-11-29 01:22:42,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:22:42,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 178 transitions. Stem has 1160 letters. Loop has 296 letters. [2023-11-29 01:22:42,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:22:42,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 178 transitions. Stem has 864 letters. Loop has 592 letters. [2023-11-29 01:22:42,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 01:22:42,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46336 states and 119025 transitions. [2023-11-29 01:22:43,239 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2341 [2023-11-29 01:22:43,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46336 states to 29643 states and 83696 transitions. [2023-11-29 01:22:43,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7137 [2023-11-29 01:22:43,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7153 [2023-11-29 01:22:43,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29643 states and 83696 transitions. [2023-11-29 01:22:43,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:22:43,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29643 states and 83696 transitions. [2023-11-29 01:22:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29643 states and 83696 transitions. [2023-11-29 01:22:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29643 to 21819. [2023-11-29 01:22:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21819 states, 11938 states have (on average 1.0371921594907019) internal successors, (12382), 11854 states have internal predecessors, (12382), 7761 states have call successors, (8559), 2188 states have call predecessors, (8559), 2120 states have return successors, (52365), 7776 states have call predecessors, (52365), 7761 states have call successors, (52365) [2023-11-29 01:22:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21819 states to 21819 states and 73306 transitions. [2023-11-29 01:22:45,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21819 states and 73306 transitions. [2023-11-29 01:22:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:45,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 01:22:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 01:22:45,158 INFO L87 Difference]: Start difference. First operand 21819 states and 73306 transitions. Second operand has 35 states, 33 states have (on average 3.484848484848485) internal successors, (115), 35 states have internal predecessors, (115), 24 states have call successors, (53), 2 states have call predecessors, (53), 11 states have return successors, (60), 21 states have call predecessors, (60), 24 states have call successors, (60) [2023-11-29 01:22:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:48,466 INFO L93 Difference]: Finished difference Result 21404 states and 71621 transitions. [2023-11-29 01:22:48,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21404 states and 71621 transitions. [2023-11-29 01:22:48,761 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2282 [2023-11-29 01:22:49,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21404 states to 20783 states and 69652 transitions. [2023-11-29 01:22:49,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7128 [2023-11-29 01:22:49,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7133 [2023-11-29 01:22:49,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20783 states and 69652 transitions. [2023-11-29 01:22:49,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-29 01:22:49,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20783 states and 69652 transitions. [2023-11-29 01:22:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20783 states and 69652 transitions. [2023-11-29 01:22:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20783 to 20262. [2023-11-29 01:22:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20262 states, 11054 states have (on average 1.0401664555816899) internal successors, (11498), 10970 states have internal predecessors, (11498), 7238 states have call successors, (7995), 1857 states have call predecessors, (7995), 1970 states have return successors, (45188), 7434 states have call predecessors, (45188), 7238 states have call successors, (45188) [2023-11-29 01:22:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20262 states to 20262 states and 64681 transitions. [2023-11-29 01:22:50,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20262 states and 64681 transitions. [2023-11-29 01:22:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 01:22:50,311 INFO L428 stractBuchiCegarLoop]: Abstraction has 20262 states and 64681 transitions. [2023-11-29 01:22:50,311 INFO L335 stractBuchiCegarLoop]: ======== Iteration 67 ============ [2023-11-29 01:22:50,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20262 states and 64681 transitions. [2023-11-29 01:22:50,422 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2231 [2023-11-29 01:22:50,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 01:22:50,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 01:22:50,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [143, 143, 110, 110, 110, 110, 33, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:50,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [45, 45, 42, 42, 42, 42, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:50,425 INFO L748 eck$LassoCheckResult]: Stem: 2061973#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2061638#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;havoc main_#t~nondet4#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2061639#L35 assume !(main_~x~0#1 < 0);havoc main_#t~nondet5#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2061679#L38 assume !(main_~y~0#1 < 0);havoc main_#t~nondet6#1;main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 2061974#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2062770#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2067607#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2067585#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2067586#$Ultimate##0 ~n := #in~n; 2067606#L25 assume ~n <= 0;#res := 1; 2067605#factFINAL assume true; 2067584#factEXIT >#72#return; 2067082#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2067083#$Ultimate##0 ~n := #in~n; 2067088#L25 assume ~n <= 0;#res := 1; 2067087#factFINAL assume true; 2067081#factEXIT >#74#return; 2066973#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2066974#$Ultimate##0 ~n := #in~n; 2067080#L25 assume ~n <= 0;#res := 1; 2066993#factFINAL assume true; 2066972#factEXIT >#76#return; 2066969#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2066970#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2071266#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071262#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071259#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2071254#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2071255#$Ultimate##0 ~n := #in~n; 2071268#L25 assume !(~n <= 0); 2071264#L26 call #t~ret0 := fact(~n - 1);< 2071265#$Ultimate##0 ~n := #in~n; 2071269#L25 assume ~n <= 0;#res := 1; 2071267#factFINAL assume true; 2071263#factEXIT >#70#return; 2071261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071258#factFINAL assume true; 2071253#factEXIT >#78#return; 2071249#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2071250#$Ultimate##0 ~n := #in~n; 2071271#L25 assume ~n <= 0;#res := 1; 2071270#factFINAL assume true; 2071248#factEXIT >#80#return; 2071245#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2071246#$Ultimate##0 ~n := #in~n; 2071806#L25 assume !(~n <= 0); 2071799#L26 call #t~ret0 := fact(~n - 1);< 2071801#$Ultimate##0 ~n := #in~n; 2077707#L25 assume ~n <= 0;#res := 1; 2077708#factFINAL assume true; 2071798#factEXIT >#70#return; 2071783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071781#factFINAL assume true; 2071244#factEXIT >#82#return; 2071242#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071241#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071240#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071238#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071233#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2071229#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2071230#$Ultimate##0 ~n := #in~n; 2071239#L25 assume !(~n <= 0); 2071235#L26 call #t~ret0 := fact(~n - 1);< 2071237#$Ultimate##0 ~n := #in~n; 2071257#L25 assume !(~n <= 0); 2071236#L26 call #t~ret0 := fact(~n - 1);< 2071252#$Ultimate##0 ~n := #in~n; 2071260#L25 assume ~n <= 0;#res := 1; 2071256#factFINAL assume true; 2071251#factEXIT >#70#return; 2071247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071243#factFINAL assume true; 2071234#factEXIT >#70#return; 2071232#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071231#factFINAL assume true; 2071228#factEXIT >#78#return; 2071225#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2071226#$Ultimate##0 ~n := #in~n; 2071277#L25 assume ~n <= 0;#res := 1; 2071275#factFINAL assume true; 2071224#factEXIT >#80#return; 2071216#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2071221#$Ultimate##0 ~n := #in~n; 2071218#L25 assume !(~n <= 0); 2071198#L26 call #t~ret0 := fact(~n - 1);< 2071206#$Ultimate##0 ~n := #in~n; 2071223#L25 assume !(~n <= 0); 2071199#L26 call #t~ret0 := fact(~n - 1);< 2071220#$Ultimate##0 ~n := #in~n; 2071227#L25 assume ~n <= 0;#res := 1; 2071222#factFINAL assume true; 2071219#factEXIT >#70#return; 2071217#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071215#factFINAL assume true; 2071213#factEXIT >#70#return; 2071214#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071619#factFINAL assume true; 2071307#factEXIT >#82#return; 2071308#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071302#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071303#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071296#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071297#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2071188#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2071194#$Ultimate##0 ~n := #in~n; 2071211#L25 assume !(~n <= 0); 2071200#L26 call #t~ret0 := fact(~n - 1);< 2071206#$Ultimate##0 ~n := #in~n; 2071223#L25 assume !(~n <= 0); 2071199#L26 call #t~ret0 := fact(~n - 1);< 2071220#$Ultimate##0 ~n := #in~n; 2071223#L25 assume !(~n <= 0); 2071199#L26 call #t~ret0 := fact(~n - 1);< 2071220#$Ultimate##0 ~n := #in~n; 2071227#L25 assume ~n <= 0;#res := 1; 2071222#factFINAL assume true; 2071219#factEXIT >#70#return; 2071217#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071215#factFINAL assume true; 2071213#factEXIT >#70#return; 2071212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071207#factFINAL assume true; 2071197#factEXIT >#70#return; 2071196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071195#factFINAL assume true; 2071187#factEXIT >#78#return; 2071192#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2071284#$Ultimate##0 ~n := #in~n; 2071447#L25 assume ~n <= 0;#res := 1; 2071446#factFINAL assume true; 2071381#factEXIT >#80#return; 2071378#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2071380#$Ultimate##0 ~n := #in~n; 2071394#L25 assume !(~n <= 0); 2071390#L26 call #t~ret0 := fact(~n - 1);< 2071393#$Ultimate##0 ~n := #in~n; 2071453#L25 assume !(~n <= 0); 2071391#L26 call #t~ret0 := fact(~n - 1);< 2071398#$Ultimate##0 ~n := #in~n; 2071441#L25 assume !(~n <= 0); 2071388#L26 call #t~ret0 := fact(~n - 1);< 2071440#$Ultimate##0 ~n := #in~n; 2071443#L25 assume ~n <= 0;#res := 1; 2071442#factFINAL assume true; 2071439#factEXIT >#70#return; 2071438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071436#factFINAL assume true; 2071434#factEXIT >#70#return; 2071410#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071411#factFINAL assume true; 2071432#factEXIT >#70#return; 2071383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071382#factFINAL assume true; 2071376#factEXIT >#82#return; 2071379#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071367#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071368#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071361#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071362#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2071356#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2071358#$Ultimate##0 ~n := #in~n; 2071450#L25 assume !(~n <= 0); 2071389#L26 call #t~ret0 := fact(~n - 1);< 2071398#$Ultimate##0 ~n := #in~n; 2071441#L25 assume !(~n <= 0); 2071388#L26 call #t~ret0 := fact(~n - 1);< 2071440#$Ultimate##0 ~n := #in~n; 2071441#L25 assume !(~n <= 0); 2071388#L26 call #t~ret0 := fact(~n - 1);< 2071440#$Ultimate##0 ~n := #in~n; 2071441#L25 assume !(~n <= 0); 2071388#L26 call #t~ret0 := fact(~n - 1);< 2071440#$Ultimate##0 ~n := #in~n; 2071443#L25 assume ~n <= 0;#res := 1; 2071442#factFINAL assume true; 2071439#factEXIT >#70#return; 2071438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071436#factFINAL assume true; 2071434#factEXIT >#70#return; 2071410#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071411#factFINAL assume true; 2071432#factEXIT >#70#return; 2071433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071397#factFINAL assume true; 2071387#factEXIT >#70#return; 2071392#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071444#factFINAL assume true; 2071355#factEXIT >#78#return; 2071316#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2071318#$Ultimate##0 ~n := #in~n; 2071327#L25 assume ~n <= 0;#res := 1; 2071325#factFINAL assume true; 2071315#factEXIT >#80#return; 2071156#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2071175#$Ultimate##0 ~n := #in~n; 2071171#L25 assume !(~n <= 0); 2071151#L26 call #t~ret0 := fact(~n - 1);< 2071157#$Ultimate##0 ~n := #in~n; 2071173#L25 assume !(~n <= 0); 2071149#L26 call #t~ret0 := fact(~n - 1);< 2071162#$Ultimate##0 ~n := #in~n; 2071174#L25 assume !(~n <= 0); 2071143#L26 call #t~ret0 := fact(~n - 1);< 2071144#$Ultimate##0 ~n := #in~n; 2071158#L25 assume !(~n <= 0); 2071142#L26 call #t~ret0 := fact(~n - 1);< 2071153#$Ultimate##0 ~n := #in~n; 2071178#L25 assume ~n <= 0;#res := 1; 2071177#factFINAL assume true; 2071176#factEXIT >#70#return; 2071172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071170#factFINAL assume true; 2071168#factEXIT >#70#return; 2071166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071163#factFINAL assume true; 2071160#factEXIT >#70#return; 2071159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071154#factFINAL assume true; 2071148#factEXIT >#70#return; 2071152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071375#factFINAL assume true; 2071374#factEXIT >#82#return; 2071369#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071366#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071363#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071359#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071352#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2071135#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2071137#$Ultimate##0 ~n := #in~n; 2071146#L25 assume !(~n <= 0); 2071141#L26 call #t~ret0 := fact(~n - 1);< 2071144#$Ultimate##0 ~n := #in~n; 2071158#L25 assume !(~n <= 0); 2071142#L26 call #t~ret0 := fact(~n - 1);< 2071153#$Ultimate##0 ~n := #in~n; 2071158#L25 assume !(~n <= 0); 2071142#L26 call #t~ret0 := fact(~n - 1);< 2071153#$Ultimate##0 ~n := #in~n; 2071158#L25 assume !(~n <= 0); 2071142#L26 call #t~ret0 := fact(~n - 1);< 2071153#$Ultimate##0 ~n := #in~n; 2071158#L25 assume !(~n <= 0); 2071142#L26 call #t~ret0 := fact(~n - 1);< 2071153#$Ultimate##0 ~n := #in~n; 2071178#L25 assume ~n <= 0;#res := 1; 2071177#factFINAL assume true; 2071176#factEXIT >#70#return; 2071172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071170#factFINAL assume true; 2071168#factEXIT >#70#return; 2071166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071163#factFINAL assume true; 2071160#factEXIT >#70#return; 2071159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071154#factFINAL assume true; 2071148#factEXIT >#70#return; 2071147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071145#factFINAL assume true; 2071140#factEXIT >#70#return; 2071139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071138#factFINAL assume true; 2071134#factEXIT >#78#return; 2071110#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2071112#$Ultimate##0 ~n := #in~n; 2071114#L25 assume ~n <= 0;#res := 1; 2071113#factFINAL assume true; 2071109#factEXIT >#80#return; 2071008#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2071016#$Ultimate##0 ~n := #in~n; 2071012#L25 assume !(~n <= 0); 2071003#L26 call #t~ret0 := fact(~n - 1);< 2071009#$Ultimate##0 ~n := #in~n; 2071018#L25 assume !(~n <= 0); 2071014#L26 call #t~ret0 := fact(~n - 1);< 2071015#$Ultimate##0 ~n := #in~n; 2071022#L25 assume !(~n <= 0); 2070996#L26 call #t~ret0 := fact(~n - 1);< 2070998#$Ultimate##0 ~n := #in~n; 2071010#L25 assume !(~n <= 0); 2070997#L26 call #t~ret0 := fact(~n - 1);< 2071005#$Ultimate##0 ~n := #in~n; 2071010#L25 assume !(~n <= 0); 2070997#L26 call #t~ret0 := fact(~n - 1);< 2071005#$Ultimate##0 ~n := #in~n; 2071029#L25 assume ~n <= 0;#res := 1; 2071028#factFINAL assume true; 2071027#factEXIT >#70#return; 2071026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071025#factFINAL assume true; 2071024#factEXIT >#70#return; 2071023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071021#factFINAL assume true; 2071020#factEXIT >#70#return; 2071019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071017#factFINAL assume true; 2071013#factEXIT >#70#return; 2071011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071006#factFINAL assume true; 2071002#factEXIT >#70#return; 2071004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071313#factFINAL assume true; 2071290#factEXIT >#82#return; 2071186#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071132#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071117#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071091#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071085#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2070989#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2070991#$Ultimate##0 ~n := #in~n; 2071000#L25 assume !(~n <= 0); 2070995#L26 call #t~ret0 := fact(~n - 1);< 2070998#$Ultimate##0 ~n := #in~n; 2071010#L25 assume !(~n <= 0); 2070997#L26 call #t~ret0 := fact(~n - 1);< 2071005#$Ultimate##0 ~n := #in~n; 2071010#L25 assume !(~n <= 0); 2070997#L26 call #t~ret0 := fact(~n - 1);< 2071005#$Ultimate##0 ~n := #in~n; 2071010#L25 assume !(~n <= 0); 2070997#L26 call #t~ret0 := fact(~n - 1);< 2071005#$Ultimate##0 ~n := #in~n; 2071010#L25 assume !(~n <= 0); 2070997#L26 call #t~ret0 := fact(~n - 1);< 2071005#$Ultimate##0 ~n := #in~n; 2071010#L25 assume !(~n <= 0); 2070997#L26 call #t~ret0 := fact(~n - 1);< 2071005#$Ultimate##0 ~n := #in~n; 2071029#L25 assume ~n <= 0;#res := 1; 2071028#factFINAL assume true; 2071027#factEXIT >#70#return; 2071026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071025#factFINAL assume true; 2071024#factEXIT >#70#return; 2071023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071021#factFINAL assume true; 2071020#factEXIT >#70#return; 2071019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071017#factFINAL assume true; 2071013#factEXIT >#70#return; 2071011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071006#factFINAL assume true; 2071002#factEXIT >#70#return; 2071001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070999#factFINAL assume true; 2070994#factEXIT >#70#return; 2070993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070992#factFINAL assume true; 2070988#factEXIT >#78#return; 2070982#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2070984#$Ultimate##0 ~n := #in~n; 2070986#L25 assume ~n <= 0;#res := 1; 2070985#factFINAL assume true; 2070981#factEXIT >#80#return; 2070949#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2070957#$Ultimate##0 ~n := #in~n; 2070953#L25 assume !(~n <= 0); 2070944#L26 call #t~ret0 := fact(~n - 1);< 2070950#$Ultimate##0 ~n := #in~n; 2070959#L25 assume !(~n <= 0); 2070955#L26 call #t~ret0 := fact(~n - 1);< 2070956#$Ultimate##0 ~n := #in~n; 2070965#L25 assume !(~n <= 0); 2070962#L26 call #t~ret0 := fact(~n - 1);< 2070963#$Ultimate##0 ~n := #in~n; 2070971#L25 assume !(~n <= 0); 2070968#L26 call #t~ret0 := fact(~n - 1);< 2070969#$Ultimate##0 ~n := #in~n; 2070975#L25 assume !(~n <= 0); 2070938#L26 call #t~ret0 := fact(~n - 1);< 2070939#$Ultimate##0 ~n := #in~n; 2070951#L25 assume !(~n <= 0); 2070936#L26 call #t~ret0 := fact(~n - 1);< 2070946#$Ultimate##0 ~n := #in~n; 2070979#L25 assume ~n <= 0;#res := 1; 2070978#factFINAL assume true; 2070977#factEXIT >#70#return; 2070976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070974#factFINAL assume true; 2070973#factEXIT >#70#return; 2070972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070970#factFINAL assume true; 2070967#factEXIT >#70#return; 2070966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070964#factFINAL assume true; 2070961#factEXIT >#70#return; 2070960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070958#factFINAL assume true; 2070954#factEXIT >#70#return; 2070952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070947#factFINAL assume true; 2070943#factEXIT >#70#return; 2070945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071304#factFINAL assume true; 2071298#factEXIT >#82#return; 2071295#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071293#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071292#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071115#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071043#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2070930#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2070932#$Ultimate##0 ~n := #in~n; 2070941#L25 assume !(~n <= 0); 2070937#L26 call #t~ret0 := fact(~n - 1);< 2070939#$Ultimate##0 ~n := #in~n; 2070951#L25 assume !(~n <= 0); 2070936#L26 call #t~ret0 := fact(~n - 1);< 2070946#$Ultimate##0 ~n := #in~n; 2070951#L25 assume !(~n <= 0); 2070936#L26 call #t~ret0 := fact(~n - 1);< 2070946#$Ultimate##0 ~n := #in~n; 2070951#L25 assume !(~n <= 0); 2070936#L26 call #t~ret0 := fact(~n - 1);< 2070946#$Ultimate##0 ~n := #in~n; 2070951#L25 assume !(~n <= 0); 2070936#L26 call #t~ret0 := fact(~n - 1);< 2070946#$Ultimate##0 ~n := #in~n; 2070951#L25 assume !(~n <= 0); 2070936#L26 call #t~ret0 := fact(~n - 1);< 2070946#$Ultimate##0 ~n := #in~n; 2070951#L25 assume !(~n <= 0); 2070936#L26 call #t~ret0 := fact(~n - 1);< 2070946#$Ultimate##0 ~n := #in~n; 2070979#L25 assume ~n <= 0;#res := 1; 2070978#factFINAL assume true; 2070977#factEXIT >#70#return; 2070976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070974#factFINAL assume true; 2070973#factEXIT >#70#return; 2070972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070970#factFINAL assume true; 2070967#factEXIT >#70#return; 2070966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070964#factFINAL assume true; 2070961#factEXIT >#70#return; 2070960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070958#factFINAL assume true; 2070954#factEXIT >#70#return; 2070952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070947#factFINAL assume true; 2070943#factEXIT >#70#return; 2070942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070940#factFINAL assume true; 2070935#factEXIT >#70#return; 2070934#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070933#factFINAL assume true; 2070929#factEXIT >#78#return; 2070892#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2070893#$Ultimate##0 ~n := #in~n; 2070913#L25 assume ~n <= 0;#res := 1; 2070909#factFINAL assume true; 2070890#factEXIT >#80#return; 2070843#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2070852#$Ultimate##0 ~n := #in~n; 2070847#L25 assume !(~n <= 0); 2070838#L26 call #t~ret0 := fact(~n - 1);< 2070844#$Ultimate##0 ~n := #in~n; 2070910#L25 assume !(~n <= 0); 2070849#L26 call #t~ret0 := fact(~n - 1);< 2070851#$Ultimate##0 ~n := #in~n; 2070894#L25 assume !(~n <= 0); 2070856#L26 call #t~ret0 := fact(~n - 1);< 2070858#$Ultimate##0 ~n := #in~n; 2070888#L25 assume !(~n <= 0); 2070863#L26 call #t~ret0 := fact(~n - 1);< 2070866#$Ultimate##0 ~n := #in~n; 2070907#L25 assume !(~n <= 0); 2070870#L26 call #t~ret0 := fact(~n - 1);< 2070871#$Ultimate##0 ~n := #in~n; 2070878#L25 assume !(~n <= 0); 2070865#L26 call #t~ret0 := fact(~n - 1);< 2070876#$Ultimate##0 ~n := #in~n; 2070879#L25 assume !(~n <= 0); 2070862#L26 call #t~ret0 := fact(~n - 1);< 2070875#$Ultimate##0 ~n := #in~n; 2070884#L25 assume ~n <= 0;#res := 1; 2070883#factFINAL assume true; 2070881#factEXIT >#70#return; 2070880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070877#factFINAL assume true; 2070874#factEXIT >#70#return; 2070873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070872#factFINAL assume true; 2070869#factEXIT >#70#return; 2070868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070867#factFINAL assume true; 2070861#factEXIT >#70#return; 2070860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070859#factFINAL assume true; 2070855#factEXIT >#70#return; 2070854#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070853#factFINAL assume true; 2070848#factEXIT >#70#return; 2070846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070841#factFINAL assume true; 2070836#factEXIT >#70#return; 2070839#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071051#factFINAL assume true; 2071038#factEXIT >#82#return; 2071035#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071033#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2070987#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2070980#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2070926#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2070826#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2070827#$Ultimate##0 ~n := #in~n; 2070834#L25 assume !(~n <= 0); 2070831#L26 call #t~ret0 := fact(~n - 1);< 2070832#$Ultimate##0 ~n := #in~n; 2070845#L25 assume !(~n <= 0); 2070837#L26 call #t~ret0 := fact(~n - 1);< 2070840#$Ultimate##0 ~n := #in~n; 2070882#L25 assume !(~n <= 0); 2070850#L26 call #t~ret0 := fact(~n - 1);< 2070896#$Ultimate##0 ~n := #in~n; 2070895#L25 assume !(~n <= 0); 2070857#L26 call #t~ret0 := fact(~n - 1);< 2070886#$Ultimate##0 ~n := #in~n; 2070885#L25 assume !(~n <= 0); 2070864#L26 call #t~ret0 := fact(~n - 1);< 2070876#$Ultimate##0 ~n := #in~n; 2070879#L25 assume !(~n <= 0); 2070862#L26 call #t~ret0 := fact(~n - 1);< 2070875#$Ultimate##0 ~n := #in~n; 2070879#L25 assume !(~n <= 0); 2070862#L26 call #t~ret0 := fact(~n - 1);< 2070875#$Ultimate##0 ~n := #in~n; 2070879#L25 assume !(~n <= 0); 2070862#L26 call #t~ret0 := fact(~n - 1);< 2070875#$Ultimate##0 ~n := #in~n; 2070884#L25 assume ~n <= 0;#res := 1; 2070883#factFINAL assume true; 2070881#factEXIT >#70#return; 2070880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070877#factFINAL assume true; 2070874#factEXIT >#70#return; 2070873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070872#factFINAL assume true; 2070869#factEXIT >#70#return; 2070868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070867#factFINAL assume true; 2070861#factEXIT >#70#return; 2070860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070859#factFINAL assume true; 2070855#factEXIT >#70#return; 2070854#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070853#factFINAL assume true; 2070848#factEXIT >#70#return; 2070846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070841#factFINAL assume true; 2070836#factEXIT >#70#return; 2070835#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070833#factFINAL assume true; 2070830#factEXIT >#70#return; 2070829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070828#factFINAL assume true; 2070824#factEXIT >#78#return; 2070815#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2070817#$Ultimate##0 ~n := #in~n; 2070819#L25 assume ~n <= 0;#res := 1; 2070818#factFINAL assume true; 2070814#factEXIT >#80#return; 2070349#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2070355#$Ultimate##0 ~n := #in~n; 2070354#L25 assume !(~n <= 0); 2070343#L26 call #t~ret0 := fact(~n - 1);< 2070351#$Ultimate##0 ~n := #in~n; 2070365#L25 assume !(~n <= 0); 2070360#L26 call #t~ret0 := fact(~n - 1);< 2070362#$Ultimate##0 ~n := #in~n; 2070381#L25 assume !(~n <= 0); 2070378#L26 call #t~ret0 := fact(~n - 1);< 2070380#$Ultimate##0 ~n := #in~n; 2070391#L25 assume !(~n <= 0); 2070385#L26 call #t~ret0 := fact(~n - 1);< 2070386#$Ultimate##0 ~n := #in~n; 2070482#L25 assume !(~n <= 0); 2070470#L26 call #t~ret0 := fact(~n - 1);< 2070471#$Ultimate##0 ~n := #in~n; 2070492#L25 assume !(~n <= 0); 2070265#L26 call #t~ret0 := fact(~n - 1);< 2070387#$Ultimate##0 ~n := #in~n; 2070510#L25 assume !(~n <= 0); 2070261#L26 call #t~ret0 := fact(~n - 1);< 2070509#$Ultimate##0 ~n := #in~n; 2070510#L25 assume !(~n <= 0); 2070261#L26 call #t~ret0 := fact(~n - 1);< 2070509#$Ultimate##0 ~n := #in~n; 2070513#L25 assume ~n <= 0;#res := 1; 2070511#factFINAL assume true; 2070508#factEXIT >#70#return; 2070507#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070506#factFINAL assume true; 2070503#factEXIT >#70#return; 2070502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070501#factFINAL assume true; 2070489#factEXIT >#70#return; 2070488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070485#factFINAL assume true; 2070469#factEXIT >#70#return; 2070467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070466#factFINAL assume true; 2070384#factEXIT >#70#return; 2070383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070382#factFINAL assume true; 2070377#factEXIT >#70#return; 2070376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070373#factFINAL assume true; 2070359#factEXIT >#70#return; 2070357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070348#factFINAL assume true; 2070342#factEXIT >#70#return; 2070344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2071613#factFINAL assume true; 2071589#factEXIT >#82#return; 2071590#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071622#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071621#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071620#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071615#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2070111#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2070114#$Ultimate##0 ~n := #in~n; 2070274#L25 assume !(~n <= 0); 2070262#L26 call #t~ret0 := fact(~n - 1);< 2070273#$Ultimate##0 ~n := #in~n; 2070792#L25 assume !(~n <= 0); 2070259#L26 call #t~ret0 := fact(~n - 1);< 2070345#$Ultimate##0 ~n := #in~n; 2070793#L25 assume !(~n <= 0); 2070256#L26 call #t~ret0 := fact(~n - 1);< 2070361#$Ultimate##0 ~n := #in~n; 2070794#L25 assume !(~n <= 0); 2070269#L26 call #t~ret0 := fact(~n - 1);< 2070379#$Ultimate##0 ~n := #in~n; 2070795#L25 assume !(~n <= 0); 2070266#L26 call #t~ret0 := fact(~n - 1);< 2070387#$Ultimate##0 ~n := #in~n; 2070510#L25 assume !(~n <= 0); 2070261#L26 call #t~ret0 := fact(~n - 1);< 2070509#$Ultimate##0 ~n := #in~n; 2070510#L25 assume !(~n <= 0); 2070261#L26 call #t~ret0 := fact(~n - 1);< 2070509#$Ultimate##0 ~n := #in~n; 2070510#L25 assume !(~n <= 0); 2070261#L26 call #t~ret0 := fact(~n - 1);< 2070509#$Ultimate##0 ~n := #in~n; 2070510#L25 assume !(~n <= 0); 2070261#L26 call #t~ret0 := fact(~n - 1);< 2070509#$Ultimate##0 ~n := #in~n; 2070513#L25 assume ~n <= 0;#res := 1; 2070511#factFINAL assume true; 2070508#factEXIT >#70#return; 2070507#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070506#factFINAL assume true; 2070503#factEXIT >#70#return; 2070502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070501#factFINAL assume true; 2070489#factEXIT >#70#return; 2070488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070485#factFINAL assume true; 2070469#factEXIT >#70#return; 2070467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070466#factFINAL assume true; 2070384#factEXIT >#70#return; 2070383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070382#factFINAL assume true; 2070377#factEXIT >#70#return; 2070376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070373#factFINAL assume true; 2070359#factEXIT >#70#return; 2070357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070348#factFINAL assume true; 2070342#factEXIT >#70#return; 2070341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070275#factFINAL assume true; 2070254#factEXIT >#70#return; 2070119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070117#factFINAL assume true; 2070107#factEXIT >#78#return; 2070112#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2070089#$Ultimate##0 ~n := #in~n; 2079063#L25 assume ~n <= 0;#res := 1; 2079057#factFINAL assume true; 2079055#factEXIT >#80#return; 2071845#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2078375#$Ultimate##0 ~n := #in~n; 2078368#L25 assume !(~n <= 0); 2071814#L26 call #t~ret0 := fact(~n - 1);< 2078753#$Ultimate##0 ~n := #in~n; 2078752#L25 assume !(~n <= 0); 2071827#L26 call #t~ret0 := fact(~n - 1);< 2078751#$Ultimate##0 ~n := #in~n; 2078750#L25 assume !(~n <= 0); 2071825#L26 call #t~ret0 := fact(~n - 1);< 2078668#$Ultimate##0 ~n := #in~n; 2078663#L25 assume !(~n <= 0); 2071822#L26 call #t~ret0 := fact(~n - 1);< 2078748#$Ultimate##0 ~n := #in~n; 2078556#L25 assume !(~n <= 0); 2071819#L26 call #t~ret0 := fact(~n - 1);< 2078672#$Ultimate##0 ~n := #in~n; 2078673#L25 assume !(~n <= 0); 2071816#L26 call #t~ret0 := fact(~n - 1);< 2078746#$Ultimate##0 ~n := #in~n; 2078749#L25 assume !(~n <= 0); 2071829#L26 call #t~ret0 := fact(~n - 1);< 2078747#$Ultimate##0 ~n := #in~n; 2079162#L25 assume !(~n <= 0); 2071826#L26 call #t~ret0 := fact(~n - 1);< 2078734#$Ultimate##0 ~n := #in~n; 2078728#L25 assume !(~n <= 0); 2071824#L26 call #t~ret0 := fact(~n - 1);< 2078727#$Ultimate##0 ~n := #in~n; 2078724#L25 assume ~n <= 0;#res := 1; 2078725#factFINAL assume true; 2078720#factEXIT >#70#return; 2078721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2078717#factFINAL assume true; 2078714#factEXIT >#70#return; 2078715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2079145#factFINAL assume true; 2079144#factEXIT >#70#return; 2079143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2079142#factFINAL assume true; 2079141#factEXIT >#70#return; 2078010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2078009#factFINAL assume true; 2078007#factEXIT >#70#return; 2078006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077965#factFINAL assume true; 2077950#factEXIT >#70#return; 2077948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077941#factFINAL assume true; 2077939#factEXIT >#70#return; 2077938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077935#factFINAL assume true; 2077927#factEXIT >#70#return; 2077875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077876#factFINAL assume true; 2077723#factEXIT >#70#return; 2077724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2079095#factFINAL assume true; 2071843#factEXIT >#82#return; 2071842#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2071841#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2071838#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2071836#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2071812#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2071804#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2071805#$Ultimate##0 ~n := #in~n; 2071837#L25 assume !(~n <= 0); 2071820#L26 call #t~ret0 := fact(~n - 1);< 2071835#$Ultimate##0 ~n := #in~n; 2079008#L25 assume !(~n <= 0); 2071818#L26 call #t~ret0 := fact(~n - 1);< 2077725#$Ultimate##0 ~n := #in~n; 2079215#L25 assume !(~n <= 0); 2071817#L26 call #t~ret0 := fact(~n - 1);< 2077928#$Ultimate##0 ~n := #in~n; 2079166#L25 assume !(~n <= 0); 2071815#L26 call #t~ret0 := fact(~n - 1);< 2077940#$Ultimate##0 ~n := #in~n; 2079163#L25 assume !(~n <= 0); 2071830#L26 call #t~ret0 := fact(~n - 1);< 2078734#$Ultimate##0 ~n := #in~n; 2078728#L25 assume !(~n <= 0); 2071824#L26 call #t~ret0 := fact(~n - 1);< 2078727#$Ultimate##0 ~n := #in~n; 2078728#L25 assume !(~n <= 0); 2071824#L26 call #t~ret0 := fact(~n - 1);< 2078727#$Ultimate##0 ~n := #in~n; 2078728#L25 assume !(~n <= 0); 2071824#L26 call #t~ret0 := fact(~n - 1);< 2078727#$Ultimate##0 ~n := #in~n; 2078728#L25 assume !(~n <= 0); 2071824#L26 call #t~ret0 := fact(~n - 1);< 2078727#$Ultimate##0 ~n := #in~n; 2078728#L25 assume !(~n <= 0); 2071824#L26 call #t~ret0 := fact(~n - 1);< 2078727#$Ultimate##0 ~n := #in~n; 2078724#L25 assume ~n <= 0;#res := 1; 2078725#factFINAL assume true; 2078720#factEXIT >#70#return; 2078721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2078717#factFINAL assume true; 2078714#factEXIT >#70#return; 2078715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2079145#factFINAL assume true; 2079144#factEXIT >#70#return; 2079143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2079142#factFINAL assume true; 2079141#factEXIT >#70#return; 2078010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2078009#factFINAL assume true; 2078007#factEXIT >#70#return; 2078006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077965#factFINAL assume true; 2077950#factEXIT >#70#return; 2077948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077941#factFINAL assume true; 2077939#factEXIT >#70#return; 2077938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077935#factFINAL assume true; 2077927#factEXIT >#70#return; 2077875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077876#factFINAL assume true; 2077723#factEXIT >#70#return; 2077720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2077721#factFINAL assume true; 2071813#factEXIT >#70#return; 2071833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2078849#factFINAL assume true; 2078848#factEXIT >#78#return; 2071786#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2071789#$Ultimate##0 ~n := #in~n; 2071788#L25 assume ~n <= 0;#res := 1; 2071785#factFINAL assume true; 2071787#factEXIT >#80#return; 2069780#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2070463#$Ultimate##0 ~n := #in~n; 2069865#L25 assume !(~n <= 0); 2069824#L26 call #t~ret0 := fact(~n - 1);< 2070024#$Ultimate##0 ~n := #in~n; 2070791#L25 assume !(~n <= 0); 2069831#L26 call #t~ret0 := fact(~n - 1);< 2070315#$Ultimate##0 ~n := #in~n; 2070802#L25 assume !(~n <= 0); 2069810#L26 call #t~ret0 := fact(~n - 1);< 2070328#$Ultimate##0 ~n := #in~n; 2071082#L25 assume !(~n <= 0); 2069815#L26 call #t~ret0 := fact(~n - 1);< 2070452#$Ultimate##0 ~n := #in~n; 2070560#L25 assume !(~n <= 0); 2069822#L26 call #t~ret0 := fact(~n - 1);< 2070544#$Ultimate##0 ~n := #in~n; 2070561#L25 assume !(~n <= 0); 2069830#L26 call #t~ret0 := fact(~n - 1);< 2070550#$Ultimate##0 ~n := #in~n; 2070588#L25 assume !(~n <= 0); 2069811#L26 call #t~ret0 := fact(~n - 1);< 2070558#$Ultimate##0 ~n := #in~n; 2070589#L25 assume !(~n <= 0); 2069817#L26 call #t~ret0 := fact(~n - 1);< 2070565#$Ultimate##0 ~n := #in~n; 2070590#L25 assume !(~n <= 0); 2069827#L26 call #t~ret0 := fact(~n - 1);< 2069862#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070624#L25 assume ~n <= 0;#res := 1; 2070623#factFINAL assume true; 2070572#factEXIT >#70#return; 2070570#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070569#factFINAL assume true; 2070568#factEXIT >#70#return; 2070567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070566#factFINAL assume true; 2070564#factEXIT >#70#return; 2070563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070562#factFINAL assume true; 2070557#factEXIT >#70#return; 2070554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070552#factFINAL assume true; 2070549#factEXIT >#70#return; 2070547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070546#factFINAL assume true; 2070543#factEXIT >#70#return; 2070541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070540#factFINAL assume true; 2070451#factEXIT >#70#return; 2070450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070449#factFINAL assume true; 2070327#factEXIT >#70#return; 2070326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070317#factFINAL assume true; 2070313#factEXIT >#70#return; 2070310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070309#factFINAL assume true; 2070248#factEXIT >#70#return; 2069839#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069866#factFINAL assume true; 2069867#factEXIT >#82#return; 2069685#L30-8 [2023-11-29 01:22:50,426 INFO L750 eck$LassoCheckResult]: Loop: 2069685#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2069684#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;havoc binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2069683#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2069682#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2069677#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2061600#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2061601#$Ultimate##0 ~n := #in~n; 2069848#L25 assume !(~n <= 0); 2069820#L26 call #t~ret0 := fact(~n - 1);< 2069841#$Ultimate##0 ~n := #in~n; 2069888#L25 assume !(~n <= 0); 2069832#L26 call #t~ret0 := fact(~n - 1);< 2069847#$Ultimate##0 ~n := #in~n; 2069863#L25 assume !(~n <= 0); 2069813#L26 call #t~ret0 := fact(~n - 1);< 2069854#$Ultimate##0 ~n := #in~n; 2069868#L25 assume !(~n <= 0); 2069821#L26 call #t~ret0 := fact(~n - 1);< 2069858#$Ultimate##0 ~n := #in~n; 2070559#L25 assume !(~n <= 0); 2069834#L26 call #t~ret0 := fact(~n - 1);< 2069862#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070624#L25 assume ~n <= 0;#res := 1; 2070623#factFINAL assume true; 2070572#factEXIT >#70#return; 2070570#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070569#factFINAL assume true; 2070568#factEXIT >#70#return; 2070567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070566#factFINAL assume true; 2070564#factEXIT >#70#return; 2070563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070562#factFINAL assume true; 2070557#factEXIT >#70#return; 2070554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070552#factFINAL assume true; 2070549#factEXIT >#70#return; 2070547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070546#factFINAL assume true; 2070543#factEXIT >#70#return; 2070541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070540#factFINAL assume true; 2070451#factEXIT >#70#return; 2070450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070449#factFINAL assume true; 2070327#factEXIT >#70#return; 2070326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070317#factFINAL assume true; 2070313#factEXIT >#70#return; 2070310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070309#factFINAL assume true; 2070248#factEXIT >#70#return; 2070247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070245#factFINAL assume true; 2070048#factEXIT >#70#return; 2070047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070046#factFINAL assume true; 2070032#factEXIT >#70#return; 2070027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070023#factFINAL assume true; 2070010#factEXIT >#70#return; 2070009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070008#factFINAL assume true; 2069988#factEXIT >#70#return; 2069901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069898#factFINAL assume true; 2069895#factEXIT >#70#return; 2069893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069889#factFINAL assume true; 2069882#factEXIT >#70#return; 2069880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069876#factFINAL assume true; 2069870#factEXIT >#70#return; 2069864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069860#factFINAL assume true; 2069861#factEXIT >#70#return; 2069869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069875#factFINAL assume true; 2069874#factEXIT >#70#return; 2069873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069872#factFINAL assume true; 2069842#factEXIT >#70#return; 2069843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069859#factFINAL assume true; 2069857#factEXIT >#70#return; 2069856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069855#factFINAL assume true; 2069853#factEXIT >#70#return; 2069852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069851#factFINAL assume true; 2069850#factEXIT >#70#return; 2069836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069845#factFINAL assume true; 2069804#factEXIT >#70#return; 2069802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069797#factFINAL assume true; 2069795#factEXIT >#78#return; 2069777#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2069781#$Ultimate##0 ~n := #in~n; 2069796#L25 assume ~n <= 0;#res := 1; 2069794#factFINAL assume true; 2069776#factEXIT >#80#return; 2069687#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2069798#$Ultimate##0 ~n := #in~n; 2069849#L25 assume !(~n <= 0); 2069819#L26 call #t~ret0 := fact(~n - 1);< 2069844#$Ultimate##0 ~n := #in~n; 2070512#L25 assume !(~n <= 0); 2069828#L26 call #t~ret0 := fact(~n - 1);< 2069871#$Ultimate##0 ~n := #in~n; 2069903#L25 assume !(~n <= 0); 2069823#L26 call #t~ret0 := fact(~n - 1);< 2069883#$Ultimate##0 ~n := #in~n; 2070601#L25 assume !(~n <= 0); 2069812#L26 call #t~ret0 := fact(~n - 1);< 2069897#$Ultimate##0 ~n := #in~n; 2070020#L25 assume !(~n <= 0); 2069826#L26 call #t~ret0 := fact(~n - 1);< 2069989#$Ultimate##0 ~n := #in~n; 2071421#L25 assume !(~n <= 0); 2069814#L26 call #t~ret0 := fact(~n - 1);< 2070011#$Ultimate##0 ~n := #in~n; 2070155#L25 assume !(~n <= 0); 2069833#L26 call #t~ret0 := fact(~n - 1);< 2070033#$Ultimate##0 ~n := #in~n; 2071486#L25 assume !(~n <= 0); 2069818#L26 call #t~ret0 := fact(~n - 1);< 2070049#$Ultimate##0 ~n := #in~n; 2070768#L25 assume !(~n <= 0); 2069807#L26 call #t~ret0 := fact(~n - 1);< 2070249#$Ultimate##0 ~n := #in~n; 2070791#L25 assume !(~n <= 0); 2069831#L26 call #t~ret0 := fact(~n - 1);< 2070315#$Ultimate##0 ~n := #in~n; 2070802#L25 assume !(~n <= 0); 2069810#L26 call #t~ret0 := fact(~n - 1);< 2070328#$Ultimate##0 ~n := #in~n; 2071082#L25 assume !(~n <= 0); 2069815#L26 call #t~ret0 := fact(~n - 1);< 2070452#$Ultimate##0 ~n := #in~n; 2070560#L25 assume !(~n <= 0); 2069822#L26 call #t~ret0 := fact(~n - 1);< 2070544#$Ultimate##0 ~n := #in~n; 2070561#L25 assume !(~n <= 0); 2069830#L26 call #t~ret0 := fact(~n - 1);< 2070550#$Ultimate##0 ~n := #in~n; 2070588#L25 assume !(~n <= 0); 2069811#L26 call #t~ret0 := fact(~n - 1);< 2070558#$Ultimate##0 ~n := #in~n; 2070589#L25 assume !(~n <= 0); 2069817#L26 call #t~ret0 := fact(~n - 1);< 2070565#$Ultimate##0 ~n := #in~n; 2070590#L25 assume !(~n <= 0); 2069827#L26 call #t~ret0 := fact(~n - 1);< 2069862#$Ultimate##0 ~n := #in~n; 2070626#L25 assume !(~n <= 0); 2069806#L26 call #t~ret0 := fact(~n - 1);< 2070573#$Ultimate##0 ~n := #in~n; 2070624#L25 assume ~n <= 0;#res := 1; 2070623#factFINAL assume true; 2070572#factEXIT >#70#return; 2070570#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070569#factFINAL assume true; 2070568#factEXIT >#70#return; 2070567#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070566#factFINAL assume true; 2070564#factEXIT >#70#return; 2070563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070562#factFINAL assume true; 2070557#factEXIT >#70#return; 2070554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070552#factFINAL assume true; 2070549#factEXIT >#70#return; 2070547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070546#factFINAL assume true; 2070543#factEXIT >#70#return; 2070541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070540#factFINAL assume true; 2070451#factEXIT >#70#return; 2070450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070449#factFINAL assume true; 2070327#factEXIT >#70#return; 2070326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070317#factFINAL assume true; 2070313#factEXIT >#70#return; 2070310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070309#factFINAL assume true; 2070248#factEXIT >#70#return; 2070247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070245#factFINAL assume true; 2070048#factEXIT >#70#return; 2070047#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070046#factFINAL assume true; 2070032#factEXIT >#70#return; 2070027#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070023#factFINAL assume true; 2070010#factEXIT >#70#return; 2070009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2070008#factFINAL assume true; 2069988#factEXIT >#70#return; 2069901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069898#factFINAL assume true; 2069895#factEXIT >#70#return; 2069893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069889#factFINAL assume true; 2069882#factEXIT >#70#return; 2069880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069876#factFINAL assume true; 2069870#factEXIT >#70#return; 2069864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069860#factFINAL assume true; 2069861#factEXIT >#70#return; 2069803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2069801#factFINAL assume true; 2069686#factEXIT >#82#return; 2069685#L30-8 [2023-11-29 01:22:50,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 755500806, now seen corresponding path program 32 times [2023-11-29 01:22:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:22:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258169180] [2023-11-29 01:22:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:22:50,476 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:22:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843612009] [2023-11-29 01:22:50,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:22:50,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:22:50,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:22:50,478 INFO L229 MonitoredProcess]: Starting monitored process 657 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:22:50,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (657)] Waiting until timeout for monitored process [2023-11-29 01:22:56,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:22:56,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 01:22:56,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:23:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:23:14,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:23:14,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:23:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1143956420, now seen corresponding path program 33 times [2023-11-29 01:23:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:23:14,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764607093] [2023-11-29 01:23:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:23:14,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:23:14,819 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:23:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715724144] [2023-11-29 01:23:14,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:23:14,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:23:14,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:23:14,821 INFO L229 MonitoredProcess]: Starting monitored process 658 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:23:14,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbcf1d04-a677-49b1-b559-7538c5254f6f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (658)] Waiting until timeout for monitored process [2023-11-29 01:23:16,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2023-11-29 01:23:16,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:23:16,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-29 01:23:16,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:23:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5682 backedges. 1121 proven. 2774 refuted. 0 times theorem prover too weak. 1787 trivial. 0 not checked. [2023-11-29 01:23:17,806 INFO L327 TraceCheckSpWp]: Computing backward predicates...